結果
問題 | No.1078 I love Matrix Construction |
ユーザー | ttr |
提出日時 | 2020-06-13 16:25:37 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,260 bytes |
コンパイル時間 | 785 ms |
コンパイル使用メモリ | 86,936 KB |
実行使用メモリ | 216,616 KB |
最終ジャッジ日時 | 2023-09-07 20:22:03 |
合計ジャッジ時間 | 14,887 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 97 ms
71,020 KB |
testcase_01 | AC | 102 ms
70,988 KB |
testcase_02 | AC | 303 ms
99,696 KB |
testcase_03 | AC | 499 ms
133,412 KB |
testcase_04 | AC | 595 ms
147,488 KB |
testcase_05 | AC | 585 ms
148,304 KB |
testcase_06 | AC | 299 ms
97,564 KB |
testcase_07 | AC | 240 ms
83,596 KB |
testcase_08 | AC | 551 ms
146,296 KB |
testcase_09 | WA | - |
testcase_10 | AC | 981 ms
216,616 KB |
testcase_11 | AC | 620 ms
155,704 KB |
testcase_12 | AC | 843 ms
202,028 KB |
testcase_13 | AC | 904 ms
211,984 KB |
testcase_14 | AC | 720 ms
173,364 KB |
testcase_15 | AC | 883 ms
201,216 KB |
testcase_16 | AC | 227 ms
83,272 KB |
testcase_17 | AC | 95 ms
71,096 KB |
testcase_18 | AC | 277 ms
96,912 KB |
testcase_19 | AC | 390 ms
114,564 KB |
testcase_20 | AC | 369 ms
116,424 KB |
testcase_21 | AC | 148 ms
77,848 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) q = deque() L = [] for i in range(N): for j in range(N): for k in range(2): ele = [] n = (i*N+j)*2+k if used[n] == 1: continue q.append(n) used[n] = 1 while q: temp = q.pop() ele.append(temp) for e in E[temp]: if used[e] == 1: continue used[e] = 1 q.append(e) ele.reverse() L.extend(ele) A = [[0]*N for _ in range(N)] L.reverse() 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() cnt = 2 for ele in L2: cnt += 1 for l in ele: if l%2 == 0: r = l+1 else: r = l-1 if used[r] == cnt: A = -1 break if used[r] > 2: continue A[(l//2)//N][(l//2)%N] = l%2 used[l] = cnt if A == -1: break if A == -1: print(A) else: for i in range(N): print(*A[i])