結果
問題 | No.1355 AND OR GAME |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-01-17 14:16:47 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,099 bytes |
コンパイル時間 | 3,662 ms |
コンパイル使用メモリ | 107,784 KB |
実行使用メモリ | 14,200 KB |
最終ジャッジ日時 | 2023-09-04 11:53:51 |
合計ジャッジ時間 | 23,159 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | WA | - |
testcase_02 | AC | 3 ms
4,380 KB |
testcase_03 | AC | 3 ms
4,384 KB |
testcase_04 | AC | 3 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,384 KB |
testcase_06 | AC | 3 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,384 KB |
testcase_08 | AC | 2 ms
4,384 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,384 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | WA | - |
testcase_16 | AC | 1 ms
4,384 KB |
testcase_17 | AC | 2 ms
4,380 KB |
testcase_18 | AC | 1 ms
4,384 KB |
testcase_19 | AC | 1 ms
4,384 KB |
testcase_20 | AC | 2 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,384 KB |
testcase_22 | AC | 2 ms
4,380 KB |
testcase_23 | AC | 2 ms
4,384 KB |
testcase_24 | WA | - |
testcase_25 | AC | 2 ms
4,384 KB |
testcase_26 | AC | 2 ms
4,380 KB |
testcase_27 | AC | 2 ms
4,384 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,380 KB |
testcase_30 | AC | 1 ms
4,384 KB |
testcase_31 | AC | 2 ms
4,384 KB |
testcase_32 | AC | 2 ms
4,380 KB |
testcase_33 | AC | 2 ms
4,384 KB |
testcase_34 | AC | 16 ms
4,380 KB |
testcase_35 | AC | 153 ms
12,668 KB |
testcase_36 | AC | 131 ms
12,476 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 145 ms
13,496 KB |
testcase_39 | AC | 26 ms
6,552 KB |
testcase_40 | AC | 71 ms
7,136 KB |
testcase_41 | AC | 141 ms
13,240 KB |
testcase_42 | AC | 142 ms
13,784 KB |
testcase_43 | AC | 43 ms
10,424 KB |
testcase_44 | AC | 23 ms
4,388 KB |
testcase_45 | AC | 142 ms
13,132 KB |
testcase_46 | AC | 54 ms
6,300 KB |
testcase_47 | AC | 143 ms
13,616 KB |
testcase_48 | AC | 103 ms
10,228 KB |
testcase_49 | AC | 145 ms
14,188 KB |
testcase_50 | WA | - |
testcase_51 | AC | 75 ms
9,556 KB |
testcase_52 | AC | 127 ms
12,360 KB |
testcase_53 | AC | 90 ms
9,968 KB |
testcase_54 | AC | 143 ms
13,856 KB |
testcase_55 | AC | 61 ms
13,276 KB |
testcase_56 | AC | 61 ms
12,720 KB |
testcase_57 | AC | 101 ms
10,076 KB |
testcase_58 | AC | 29 ms
4,768 KB |
testcase_59 | AC | 1 ms
4,380 KB |
testcase_60 | AC | 97 ms
10,756 KB |
testcase_61 | AC | 2 ms
4,380 KB |
testcase_62 | AC | 34 ms
9,716 KB |
testcase_63 | AC | 143 ms
13,152 KB |
testcase_64 | AC | 61 ms
13,256 KB |
testcase_65 | AC | 3 ms
4,384 KB |
testcase_66 | AC | 22 ms
6,740 KB |
testcase_67 | AC | 47 ms
6,896 KB |
testcase_68 | AC | 46 ms
5,932 KB |
testcase_69 | AC | 1 ms
4,384 KB |
testcase_70 | AC | 56 ms
6,524 KB |
testcase_71 | AC | 144 ms
14,176 KB |
testcase_72 | AC | 142 ms
13,160 KB |
testcase_73 | AC | 143 ms
12,724 KB |
testcase_74 | AC | 142 ms
12,836 KB |
testcase_75 | AC | 144 ms
13,656 KB |
testcase_76 | AC | 143 ms
13,088 KB |
testcase_77 | AC | 143 ms
14,200 KB |
testcase_78 | AC | 2 ms
4,380 KB |
testcase_79 | AC | 1 ms
4,380 KB |
testcase_80 | AC | 142 ms
13,680 KB |
testcase_81 | AC | 141 ms
13,292 KB |
testcase_82 | AC | 142 ms
13,744 KB |
testcase_83 | AC | 63 ms
13,660 KB |
testcase_84 | AC | 15 ms
6,764 KB |
testcase_85 | AC | 93 ms
11,576 KB |
testcase_86 | AC | 59 ms
6,384 KB |
testcase_87 | AC | 51 ms
6,316 KB |
testcase_88 | AC | 3 ms
4,380 KB |
testcase_89 | AC | 4 ms
4,384 KB |
testcase_90 | AC | 116 ms
11,692 KB |
testcase_91 | AC | 6 ms
4,380 KB |
testcase_92 | AC | 7 ms
4,384 KB |
testcase_93 | AC | 34 ms
11,048 KB |
testcase_94 | AC | 21 ms
6,412 KB |
testcase_95 | AC | 16 ms
6,024 KB |
testcase_96 | AC | 12 ms
6,364 KB |
testcase_97 | AC | 3 ms
4,380 KB |
testcase_98 | AC | 42 ms
11,412 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int N; long X, Y; long[] A; int[] solve() { auto ans = new int[N]; long mask = (1L << 60) - 1; long tar = Y; foreach_reverse (i; 0 .. N) { const a = A[i] & mask; if (a == tar) { ans[0 .. i + 1] = 3; return ans; } else if (!(a & ~tar)) { ans[i] = 2; mask &= ~a; } else if (!(~a & tar)) { ans[i] = 1; mask &= a; } else { return null; } tar &= mask; } if (X != tar) { return null; } return ans; } void main() { try { for (; ; ) { N = readInt(); X = readLong(); Y = readLong(); A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } const ans = solve(); if (ans) { foreach (i; 0 .. N) { if (i > 0) write(" "); write(ans[i]); } writeln; } else { writeln(-1); } } } catch (EOFException e) { } }