結果
問題 | No.2702 Nand Nor Matrix |
ユーザー | sotanishy |
提出日時 | 2024-03-29 22:58:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 313 ms / 2,000 ms |
コード長 | 1,780 bytes |
コンパイル時間 | 249 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 131,628 KB |
最終ジャッジ日時 | 2024-03-29 22:58:55 |
合計ジャッジ時間 | 15,988 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
53,460 KB |
testcase_01 | AC | 213 ms
121,108 KB |
testcase_02 | AC | 202 ms
121,072 KB |
testcase_03 | AC | 192 ms
121,100 KB |
testcase_04 | AC | 203 ms
120,968 KB |
testcase_05 | AC | 187 ms
120,860 KB |
testcase_06 | AC | 191 ms
121,100 KB |
testcase_07 | AC | 217 ms
121,196 KB |
testcase_08 | AC | 196 ms
121,180 KB |
testcase_09 | AC | 193 ms
121,216 KB |
testcase_10 | AC | 196 ms
121,188 KB |
testcase_11 | AC | 198 ms
121,244 KB |
testcase_12 | AC | 213 ms
121,308 KB |
testcase_13 | AC | 196 ms
121,340 KB |
testcase_14 | AC | 197 ms
121,184 KB |
testcase_15 | AC | 186 ms
121,172 KB |
testcase_16 | AC | 208 ms
111,920 KB |
testcase_17 | AC | 128 ms
99,664 KB |
testcase_18 | AC | 188 ms
103,184 KB |
testcase_19 | AC | 239 ms
124,288 KB |
testcase_20 | AC | 140 ms
96,600 KB |
testcase_21 | AC | 144 ms
95,988 KB |
testcase_22 | AC | 128 ms
90,484 KB |
testcase_23 | AC | 239 ms
118,528 KB |
testcase_24 | AC | 231 ms
108,712 KB |
testcase_25 | AC | 135 ms
93,696 KB |
testcase_26 | AC | 167 ms
99,280 KB |
testcase_27 | AC | 245 ms
127,680 KB |
testcase_28 | AC | 213 ms
115,104 KB |
testcase_29 | AC | 98 ms
84,812 KB |
testcase_30 | AC | 298 ms
124,372 KB |
testcase_31 | AC | 224 ms
121,012 KB |
testcase_32 | AC | 81 ms
81,436 KB |
testcase_33 | AC | 118 ms
94,096 KB |
testcase_34 | AC | 208 ms
114,888 KB |
testcase_35 | AC | 243 ms
119,712 KB |
testcase_36 | AC | 294 ms
131,120 KB |
testcase_37 | AC | 278 ms
130,220 KB |
testcase_38 | AC | 283 ms
130,348 KB |
testcase_39 | AC | 271 ms
131,120 KB |
testcase_40 | AC | 313 ms
130,220 KB |
testcase_41 | AC | 300 ms
130,220 KB |
testcase_42 | AC | 286 ms
130,220 KB |
testcase_43 | AC | 288 ms
130,348 KB |
testcase_44 | AC | 309 ms
131,628 KB |
testcase_45 | AC | 292 ms
131,500 KB |
testcase_46 | AC | 290 ms
131,628 KB |
testcase_47 | AC | 290 ms
130,224 KB |
testcase_48 | AC | 289 ms
130,220 KB |
testcase_49 | AC | 290 ms
131,500 KB |
testcase_50 | AC | 283 ms
130,092 KB |
testcase_51 | AC | 173 ms
108,524 KB |
ソースコード
import sys input = sys.stdin.readline T = 20 def naive(N, A, B, qs): X = [[[0] * N for _ in range(N)] for _ in range(T)] for i in range(N): X[0][0][i] = A[i] for i in range(1, N): X[0][i][0] = B[i] # print(*["".join(map(str, row)) for row in X], sep="\n") # print() for t in range(1, T): for i in range(N): for j in range(N): if i == 0 or j == 0: X[t][i][j] = X[t - 1][i][j] else: X[t][i][j] = ( 0 if X[t - 1][i][j] + X[t - 1][i - 1][j] + X[t - 1][i][j - 1] >= 2 else 1 ) # print(*["".join(map(str, row)) for row in X], sep="\n") # print() return [X[t][r][c] for t, r, c in qs] def solve(N, A, B, qs): if N == 1: return [A[0]] * len(qs) row = [-1] * N row[0] = B[1] for i in range(1, N): if row[i - 1] == A[i]: row[i] = A[i] ^ 1 else: break col = [-1] * N col[0] = A[1] for i in range(1, N): if col[i - 1] == B[i]: col[i] = B[i] ^ 1 else: break ans = [] for t, r, c in qs: x = -1 if r == 0: x = A[c] elif c == 0: x = B[r] elif col[r] == -1 or row[c] == -1 or r + c > t + 1: x = t % 2 else: x = A[c] ^ B[r] ^ A[1] ^ 1 ans.append(x) return ans N = int(input()) A = list(map(int, input().split())) B = [A[0]] + [int(input()) for _ in range(N - 1)] Q = int(input()) qs = [] for _ in range(Q): t, r, c = map(int, input().split()) qs.append((t, r - 1, c - 1)) print(*solve(N, A, B, qs), sep="\n")