結果
問題 | No.2702 Nand Nor Matrix |
ユーザー |
👑 |
提出日時 | 2024-03-30 00:54:23 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,011 bytes |
コンパイル時間 | 1,132 ms |
コンパイル使用メモリ | 117,180 KB |
実行使用メモリ | 21,264 KB |
最終ジャッジ日時 | 2024-09-30 17:19:27 |
合計ジャッジ時間 | 14,656 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 155 ms
6,528 KB |
testcase_02 | AC | 150 ms
6,656 KB |
testcase_03 | AC | 150 ms
6,528 KB |
testcase_04 | WA | - |
testcase_05 | AC | 155 ms
6,528 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 152 ms
6,528 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 154 ms
6,528 KB |
testcase_14 | WA | - |
testcase_15 | AC | 150 ms
6,400 KB |
testcase_16 | AC | 185 ms
13,824 KB |
testcase_17 | AC | 106 ms
10,416 KB |
testcase_18 | WA | - |
testcase_19 | AC | 219 ms
7,168 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 84 ms
9,984 KB |
testcase_23 | WA | - |
testcase_24 | AC | 191 ms
10,520 KB |
testcase_25 | AC | 89 ms
5,248 KB |
testcase_26 | AC | 120 ms
6,016 KB |
testcase_27 | AC | 262 ms
7,548 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 260 ms
21,168 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 194 ms
13,916 KB |
testcase_35 | AC | 216 ms
14,336 KB |
testcase_36 | AC | 297 ms
21,264 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 296 ms
21,260 KB |
testcase_40 | WA | - |
testcase_41 | AC | 287 ms
10,760 KB |
testcase_42 | AC | 291 ms
21,260 KB |
testcase_43 | AC | 289 ms
21,160 KB |
testcase_44 | WA | - |
testcase_45 | AC | 301 ms
21,264 KB |
testcase_46 | WA | - |
testcase_47 | AC | 293 ms
21,260 KB |
testcase_48 | AC | 294 ms
21,260 KB |
testcase_49 | AC | 290 ms
21,256 KB |
testcase_50 | AC | 287 ms
21,256 KB |
testcase_51 | AC | 179 ms
6,528 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; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } 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)); } void main() { try { for (; ; ) { const N = readInt; auto A = new int[N]; auto B = new int[N]; foreach (y; 0 .. N) A[y] = readInt; foreach (x; 1 .. N) B[x] = readInt; B[0] = A[0]; const Q = readInt; auto T = new long[Q]; auto X = new int[Q]; auto Y = new int[Q]; foreach (q; 0 .. Q) { T[q] = readLong; X[q] = readInt - 1; Y[q] = readInt - 1; } int m, n; for (n = 1; n < N && A[n] == (n & 1); ++n) {} for (m = 1; m < N && B[m] == (m & 1); ++m) {} int solve(long t, int x, int y) { if (x == 0) return A[y]; if (y == 0) return B[x]; int ret; if (x < m && y < n && x + y <= t + 1) { ret = (x + y + t) & 1; } ret ^= (t & 1); return ret; } debug { const limT = 2 * N + 5; auto brt = new int[][][](limT, N, N); foreach (y; 0 .. N) brt[0][0][y] = A[y]; foreach (x; 1 .. N) brt[0][x][0] = B[x]; foreach (t; 0 .. limT - 1) { foreach (x; 0 .. N) foreach (y; 0 .. N) { brt[t + 1][x][y] = (x == 0 || y == 0) ? brt[t][x][y] : ((brt[t][x - 1][y] + brt[t][x][y - 1] + brt[t][x][y] <= 1) ? 1 : 0); } } foreach (t; 0 .. limT) { writeln("t = ", t); foreach (x; 0 .. N) { foreach (y; 0 .. N) write(brt[t][x][y] ^ (t & 1)); writeln; } foreach (x; 0 .. N) foreach (y; 0 .. N) { const slv = solve(t, x, y); assert(brt[t][x][y] == slv, format("%s %s %s: %s %s", t, x, y, brt[t][x][y], slv)); } } } foreach (q; 0 .. Q) { writeln(solve(T[q], X[q], Y[q])); } } } catch (EOFException e) { } }