結果
問題 | No.1078 I love Matrix Construction |
ユーザー | ttr |
提出日時 | 2020-06-13 18:52:00 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,411 bytes |
コンパイル時間 | 411 ms |
コンパイル使用メモリ | 87,120 KB |
実行使用メモリ | 210,676 KB |
最終ジャッジ日時 | 2023-09-08 01:20:35 |
合計ジャッジ時間 | 14,126 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,436 KB |
testcase_01 | AC | 90 ms
71,600 KB |
testcase_02 | AC | 288 ms
95,040 KB |
testcase_03 | AC | 442 ms
124,100 KB |
testcase_04 | AC | 566 ms
145,264 KB |
testcase_05 | WA | - |
testcase_06 | AC | 288 ms
94,316 KB |
testcase_07 | AC | 209 ms
84,428 KB |
testcase_08 | AC | 495 ms
133,776 KB |
testcase_09 | WA | - |
testcase_10 | AC | 933 ms
210,676 KB |
testcase_11 | AC | 583 ms
150,348 KB |
testcase_12 | AC | 785 ms
186,732 KB |
testcase_13 | AC | 880 ms
205,120 KB |
testcase_14 | AC | 624 ms
158,716 KB |
testcase_15 | AC | 839 ms
204,540 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 252 ms
91,416 KB |
testcase_19 | AC | 347 ms
105,344 KB |
testcase_20 | AC | 368 ms
110,184 KB |
testcase_21 | AC | 140 ms
79,008 KB |
ソースコード
from collections import deque N = int(input()) S = [int(s)-1 for s in input().split()] T = [int(t)-1 for t in input().split()] U = [int(u) for u in input().split()] M = N**2*2 E = [[] for _ in range(M)] E2 = [[] for _ in range(M)] used = [0]*M for i in range(N): for j in range(N): l0 = (S[i]*N+j)*2 l1 = l0+1 r0 = (j*N+T[i])*2 r1 = r0+1 if U[i] == 0: E[l0].append(r1) E[r0].append(l1) E2[l1].append(r0) E2[r1].append(l0) elif U[i] == 1: E[l1].append(r1) E[r0].append(l0) E2[l0].append(r0) E2[r1].append(l1) elif U[i] == 2: E2[l1].append(r1) E2[r0].append(l0) E[l0].append(r0) E[r1].append(l1) else: E2[l0].append(r1) E2[r0].append(l1) E[l1].append(r0) E[r1].append(l0) L = [] for i in range(N): for j in range(N): for k in range(2): n = (i*N+j)*2+k if used[n] == 1: continue q = deque() q.append(n) used[n] = 1 h = deque() h.append(0) while q: temp = q[-1] if h[-1] == len(E[n]): q.pop() h.pop() L.append(n) else: j2 = E[n][h[-1]] h[-1] += 1 if used[j2] == 0: used[j2] = 1 q.append(j2) h.append(0) A = [[-1]*N for _ in range(N)] L2 = [] q = deque() for l in L: if used[l] == 2: continue ele = [] used[l] = 2 q.append(l) while q: temp = q.pop() ele.append(temp) for e in E2[temp]: if used[e] == 2: continue used[e] = 2 q.append(e) L2.append(ele) L2.reverse() used = [-1]*M for i in range(len(L2)): for l in L2[i]: used[l] = i for i in range(N): for j in range(N): n = (i*N+j)*2 if used[n] > used[n+1]: A[i][j] = 1 elif used[n] == used[n+1]: A = -1 break else: A[i][j] = 0 if A == -1: break if A == -1: print(A) else: for i in range(N): print(*A[i])