結果
問題 | No.483 マッチ並べ |
ユーザー | 👑 rin204 |
提出日時 | 2022-11-08 17:34:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 94 ms / 2,000 ms |
コード長 | 2,604 bytes |
コンパイル時間 | 404 ms |
コンパイル使用メモリ | 87,344 KB |
実行使用メモリ | 76,376 KB |
最終ジャッジ日時 | 2023-09-29 07:10:12 |
合計ジャッジ時間 | 8,104 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,296 KB |
testcase_01 | AC | 76 ms
71,072 KB |
testcase_02 | AC | 80 ms
71,260 KB |
testcase_03 | AC | 76 ms
71,104 KB |
testcase_04 | AC | 75 ms
71,124 KB |
testcase_05 | AC | 76 ms
71,156 KB |
testcase_06 | AC | 75 ms
71,280 KB |
testcase_07 | AC | 76 ms
70,948 KB |
testcase_08 | AC | 75 ms
71,180 KB |
testcase_09 | AC | 76 ms
71,156 KB |
testcase_10 | AC | 78 ms
71,248 KB |
testcase_11 | AC | 78 ms
71,164 KB |
testcase_12 | AC | 75 ms
70,936 KB |
testcase_13 | AC | 77 ms
71,236 KB |
testcase_14 | AC | 75 ms
71,172 KB |
testcase_15 | AC | 77 ms
70,972 KB |
testcase_16 | AC | 76 ms
71,256 KB |
testcase_17 | AC | 77 ms
71,196 KB |
testcase_18 | AC | 74 ms
70,972 KB |
testcase_19 | AC | 75 ms
71,376 KB |
testcase_20 | AC | 76 ms
71,260 KB |
testcase_21 | AC | 77 ms
71,064 KB |
testcase_22 | AC | 76 ms
70,936 KB |
testcase_23 | AC | 77 ms
71,140 KB |
testcase_24 | AC | 76 ms
71,484 KB |
testcase_25 | AC | 75 ms
71,016 KB |
testcase_26 | AC | 83 ms
76,092 KB |
testcase_27 | AC | 94 ms
76,228 KB |
testcase_28 | AC | 90 ms
75,900 KB |
testcase_29 | AC | 86 ms
75,900 KB |
testcase_30 | AC | 82 ms
75,916 KB |
testcase_31 | AC | 93 ms
76,076 KB |
testcase_32 | AC | 93 ms
76,020 KB |
testcase_33 | AC | 83 ms
76,124 KB |
testcase_34 | AC | 80 ms
75,948 KB |
testcase_35 | AC | 81 ms
75,736 KB |
testcase_36 | AC | 82 ms
75,760 KB |
testcase_37 | AC | 85 ms
76,088 KB |
testcase_38 | AC | 87 ms
75,752 KB |
testcase_39 | AC | 87 ms
75,740 KB |
testcase_40 | AC | 89 ms
75,912 KB |
testcase_41 | AC | 90 ms
75,820 KB |
testcase_42 | AC | 87 ms
76,328 KB |
testcase_43 | AC | 88 ms
76,028 KB |
testcase_44 | AC | 75 ms
71,040 KB |
testcase_45 | AC | 77 ms
71,176 KB |
testcase_46 | AC | 76 ms
70,940 KB |
testcase_47 | AC | 85 ms
75,944 KB |
testcase_48 | AC | 88 ms
75,800 KB |
testcase_49 | AC | 86 ms
76,088 KB |
testcase_50 | AC | 86 ms
76,376 KB |
testcase_51 | AC | 86 ms
76,004 KB |
testcase_52 | AC | 90 ms
76,288 KB |
testcase_53 | AC | 77 ms
70,928 KB |
testcase_54 | AC | 75 ms
71,188 KB |
testcase_55 | AC | 77 ms
71,100 KB |
ソースコード
def scc(N, G): order = [] used = [False]*N group = [None]*N RG = [[] for _ in range(N)] for i in range(N): for j in G[i]: RG[j].append(i) def dfs(pos): stack = [(1, pos), (0, pos)] while stack: t, pos = stack.pop() if t == 0: if used[pos]: stack.pop() continue used[pos] = True for npos in G[pos]: if not used[npos]: stack.append((1, npos)) stack.append((0, npos)) else: order.append(pos) def rdfs(pos, col): stack = [pos] group[pos] = col used[pos] = True while stack: pos = stack.pop() for npos in RG[pos]: if not used[npos]: used[npos] = True group[npos] = col stack.append(npos) for i in range(N): if not used[i]: dfs(i) used = [False]*N label = 0 for s in reversed(order): if not used[s]: rdfs(s, label) label += 1 return label, group class Two_SAT: def __init__(self, n): self.n = n self.G = [[] for _ in range(2 * n)] # a V B # pos_i = True -> a = i # pos_i = False -> a = ¬i def add_edge(self, i, pos_i, j, pos_j): i0 = i i1 = i + self.n if not pos_i: i0, i1 = i1, i0 j0 = j j1 = j + self.n if not pos_j: j0, j1 = j1, j0 self.G[i1].append(j0) self.G[j1].append(i0) def const(self): _, self.group = scc(2 * self.n, self.G) def check(self): for i in range(self.n): if self.group[i] == self.group[i + self.n]: return False return True def assign(self): ret = [False] * self.n for i in range(self.n): if self.group[i] > self.group[i + self.n]: ret[i] = True return ret n = int(input()) RC = [list(map(int, input().split())) for _ in range(n)] TS = Two_SAT(n) for i in range(n): r0, c0, r1, c1 = RC[i] for j in range(i + 1, n): r2, c2, r3, c3 = RC[j] for ii, p0 in enumerate([(r0, c0), (r1, c1)]): for jj, p1 in enumerate([(r2, c2), (r3, c3)]): if p0 == p1: TS.add_edge(i, ii, j, jj) TS.const() if TS.check(): print("YES") else: print("NO")