結果
問題 | No.1023 Cyclic Tour |
ユーザー | rlangevin |
提出日時 | 2024-02-03 12:14:03 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,799 bytes |
コンパイル時間 | 295 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 131,116 KB |
最終ジャッジ日時 | 2024-02-03 12:14:28 |
合計ジャッジ時間 | 24,271 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,460 KB |
testcase_01 | AC | 37 ms
53,460 KB |
testcase_02 | AC | 37 ms
53,460 KB |
testcase_03 | AC | 37 ms
53,460 KB |
testcase_04 | AC | 292 ms
90,436 KB |
testcase_05 | AC | 272 ms
90,864 KB |
testcase_06 | AC | 271 ms
91,448 KB |
testcase_07 | AC | 278 ms
90,952 KB |
testcase_08 | AC | 222 ms
92,156 KB |
testcase_09 | AC | 447 ms
116,488 KB |
testcase_10 | AC | 405 ms
117,644 KB |
testcase_11 | WA | - |
testcase_12 | AC | 405 ms
116,356 KB |
testcase_13 | AC | 386 ms
121,044 KB |
testcase_14 | AC | 380 ms
122,168 KB |
testcase_15 | AC | 415 ms
119,880 KB |
testcase_16 | AC | 498 ms
117,452 KB |
testcase_17 | AC | 506 ms
117,816 KB |
testcase_18 | AC | 527 ms
114,564 KB |
testcase_19 | AC | 473 ms
113,228 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 432 ms
103,248 KB |
testcase_26 | AC | 449 ms
100,888 KB |
testcase_27 | AC | 1,136 ms
106,364 KB |
testcase_28 | AC | 506 ms
124,124 KB |
testcase_29 | AC | 515 ms
131,052 KB |
testcase_30 | AC | 502 ms
116,840 KB |
testcase_31 | AC | 499 ms
116,208 KB |
testcase_32 | AC | 501 ms
112,152 KB |
testcase_33 | AC | 514 ms
113,120 KB |
testcase_34 | AC | 137 ms
91,180 KB |
testcase_35 | AC | 252 ms
92,532 KB |
testcase_36 | WA | - |
testcase_37 | AC | 523 ms
117,584 KB |
testcase_38 | AC | 517 ms
119,248 KB |
testcase_39 | WA | - |
testcase_40 | AC | 536 ms
111,860 KB |
testcase_41 | AC | 533 ms
112,992 KB |
testcase_42 | AC | 337 ms
93,904 KB |
testcase_43 | AC | 216 ms
92,132 KB |
testcase_44 | AC | 366 ms
98,368 KB |
testcase_45 | AC | 351 ms
131,116 KB |
testcase_46 | AC | 204 ms
113,920 KB |
testcase_47 | AC | 176 ms
94,352 KB |
testcase_48 | WA | - |
testcase_49 | AC | 286 ms
105,132 KB |
testcase_50 | AC | 242 ms
110,872 KB |
testcase_51 | AC | 158 ms
92,236 KB |
testcase_52 | AC | 178 ms
102,592 KB |
ソースコード
import sys input = sys.stdin.readline class DirectedGraph(): def __init__(self, N): self.N = N self.G = [[] for i in range(N)] self.rG = [[] for i in range(N)] self.order = [] self.used1 = [0] * N self.used2 = [0] * N self.group = [-1] * N self.label = 0 def add_edge(self, u, v): self.G[u].append(v) self.rG[v].append(u) # def dfs(self, s): # self.used1[s] = 1 # for u in self.G[s]: # if self.used1[u]: # continue # self.dfs(u) # self.order.append(s) # def rdfs(self, s, num): # self.group[s] = num # self.used2[s] = 1 # for u in self.rG[s]: # if self.used2[u]: # continue # self.rdfs(u, num) def dfs(self, s): stack = [s] while stack: u = stack.pop() if u >= 0: stack.append(~u) self.used1[u] = 1 for v in self.G[u]: if self.used1[v]: continue stack.append(v) else: u = ~u self.order.append(u) def rdfs(self, s, num): stack = [s] while stack: u = stack.pop() self.used2[u] = 1 self.group[u] = num if u >= 0: for v in self.rG[u]: if self.used2[v]: continue stack.append(v) def scc(self): for i in range(self.N): if self.used1[i]: continue self.dfs(i) for s in reversed(self.order): if self.used2[s]: continue self.rdfs(s, self.label) self.label += 1 return self.label, self.group def construct(self): nG = [set() for _ in range(self.label)] mem = [[] for i in range(self.label)] for s in range(self.N): now = self.group[s] for u in self.G[s]: if now == self.group[u]: continue nG[now].add(self.group[u]) mem[now].append(s) return nG, mem class UnionFind(object): def __init__(self, n=1): self.par = [i for i in range(n)] self.rank = [0 for _ in range(n)] self.size = [1 for _ in range(n)] def find(self, x): if self.par[x] == x: return x else: self.par[x] = self.find(self.par[x]) return self.par[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x != y: if self.rank[x] < self.rank[y]: x, y = y, x if self.rank[x] == self.rank[y]: self.rank[x] += 1 self.par[y] = x self.size[x] += self.size[y] def is_same(self, x, y): return self.find(x) == self.find(y) def get_size(self, x): x = self.find(x) return self.size[x] N, M = map(int, input().split()) G = DirectedGraph(N) A, B, C = [-1] * M, [-1] * M, [-1] * M U = UnionFind(N) for i in range(M): A[i], B[i], C[i] = map(int, input().split()) A[i], B[i] = A[i] - 1, B[i] - 1 if C[i] == 1: if U.is_same(A[i], B[i]): print("Yes") exit() U.union(A[i], B[i]) for i in range(M): if C[i] == 1: continue a, b = U.find(A[i]), U.find(B[i]) if a == b: print("Yes") exit() G.add_edge(a, b) G.scc() nG, mem = G.construct() for m in mem: if len(m) >= 2: print("Yes") exit() print("No")