結果
問題 | No.1296 OR or NOR |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-11-20 22:19:49 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 1,818 ms / 3,000 ms |
コード長 | 3,788 bytes |
コンパイル時間 | 2,040 ms |
コンパイル使用メモリ | 107,232 KB |
実行使用メモリ | 71,912 KB |
最終ジャッジ日時 | 2023-09-04 11:06:16 |
合計ジャッジ時間 | 25,706 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 286 ms
67,372 KB |
testcase_03 | AC | 291 ms
63,244 KB |
testcase_04 | AC | 836 ms
66,056 KB |
testcase_05 | AC | 840 ms
66,548 KB |
testcase_06 | AC | 345 ms
65,160 KB |
testcase_07 | AC | 336 ms
65,200 KB |
testcase_08 | AC | 339 ms
64,152 KB |
testcase_09 | AC | 352 ms
70,024 KB |
testcase_10 | AC | 368 ms
71,912 KB |
testcase_11 | AC | 308 ms
63,916 KB |
testcase_12 | AC | 290 ms
65,172 KB |
testcase_13 | AC | 331 ms
67,404 KB |
testcase_14 | AC | 1,818 ms
67,108 KB |
testcase_15 | AC | 1,501 ms
65,612 KB |
testcase_16 | AC | 1,486 ms
63,568 KB |
testcase_17 | AC | 321 ms
65,044 KB |
testcase_18 | AC | 322 ms
63,352 KB |
testcase_19 | AC | 318 ms
65,424 KB |
testcase_20 | AC | 169 ms
13,356 KB |
testcase_21 | AC | 169 ms
11,908 KB |
testcase_22 | AC | 156 ms
13,148 KB |
testcase_23 | AC | 161 ms
11,916 KB |
testcase_24 | AC | 167 ms
13,720 KB |
testcase_25 | AC | 166 ms
13,712 KB |
testcase_26 | AC | 165 ms
11,560 KB |
testcase_27 | AC | 170 ms
13,972 KB |
testcase_28 | AC | 160 ms
14,476 KB |
testcase_29 | AC | 169 ms
13,088 KB |
testcase_30 | AC | 1,530 ms
67,292 KB |
testcase_31 | AC | 1,536 ms
66,932 KB |
testcase_32 | AC | 1,530 ms
66,208 KB |
testcase_33 | AC | 1,488 ms
64,572 KB |
testcase_34 | AC | 1,486 ms
64,928 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)); } enum E = 60; void main() { try { for (; ; ) { const N = readInt(); auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } const Q = readInt(); auto B = new long[Q]; foreach (q; 0 .. Q) { B[q] = readLong(); } debug { foreach (i; 0 .. N) { // writefln("%60b %20s", A[i], A[i]); } auto brt = new int[Q]; brt[] = N + 1; foreach (p; 0 .. 1 << N) { long x; foreach (i; 0 .. N) { x |= A[i]; if (p & 1 << i) { x ^= (1L << E) - 1; } } // writefln("%0*b %s: %60b %20s", N, p, popcnt(p), x, x); foreach (q; 0 .. Q) { if (x == B[q]) { chmin(brt[q], popcnt(p)); } } } foreach (q; 0 .. Q) { if (brt[q] > N) { brt[q] = -1; } } writeln("brt = ", brt); } auto prev = new int[E][N + 1]; prev[0][] = -1; foreach (i; 0 .. N) { prev[i + 1][] = prev[i][]; foreach (e; 0 .. E) { if ((A[i] >> e) & 1) { prev[i + 1][e] = i; } } } foreach (q; 0 .. Q) { int ans; long mask = (1L << E) - 1; long tar = B[q]; for (int i = N; ; ) { int jm = -1; foreach (e; 0 .. E) { if ((mask >> e) & 1) { chmax(jm, prev[i][e]); } } if (jm == -1) { if (!(tar & mask)) { // OK } else if (!(~tar & mask)) { debug { writeln("special i = ", i); } if (i == 0) { ans = -1; } else { ++ans; } } else { ans = -1; } break; } else { const force = A[jm] & mask; debug { // writefln("i = %s, mask = %s, tar = %s: jm = %s, force = %s", i, mask, tar, jm, force); } if (!(~tar & force)) { mask &= ~force; tar = tar & mask; } else if (!(tar & force)) { ++ans; mask &= ~force; tar = ~tar & mask; } else { ans = -1; break; } i = jm; } } writeln(ans); debug { assert(brt[q] == ans); } } } } catch (EOFException e) { } }