結果
問題 | No.1023 Cyclic Tour |
ユーザー | rlangevin |
提出日時 | 2024-02-03 13:00:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 966 ms / 2,000 ms |
コード長 | 3,953 bytes |
コンパイル時間 | 204 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 131,768 KB |
最終ジャッジ日時 | 2024-02-03 13:01:11 |
合計ジャッジ時間 | 21,437 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
53,460 KB |
testcase_01 | AC | 37 ms
53,460 KB |
testcase_02 | AC | 37 ms
53,460 KB |
testcase_03 | AC | 36 ms
53,460 KB |
testcase_04 | AC | 254 ms
91,176 KB |
testcase_05 | AC | 286 ms
91,608 KB |
testcase_06 | AC | 257 ms
92,096 KB |
testcase_07 | AC | 270 ms
91,720 KB |
testcase_08 | AC | 212 ms
92,892 KB |
testcase_09 | AC | 390 ms
116,532 KB |
testcase_10 | AC | 376 ms
117,332 KB |
testcase_11 | AC | 415 ms
125,272 KB |
testcase_12 | AC | 354 ms
116,132 KB |
testcase_13 | AC | 378 ms
122,020 KB |
testcase_14 | AC | 350 ms
121,568 KB |
testcase_15 | AC | 380 ms
120,840 KB |
testcase_16 | AC | 479 ms
118,248 KB |
testcase_17 | AC | 440 ms
118,588 KB |
testcase_18 | AC | 442 ms
116,044 KB |
testcase_19 | AC | 444 ms
114,072 KB |
testcase_20 | AC | 423 ms
112,932 KB |
testcase_21 | AC | 452 ms
109,736 KB |
testcase_22 | AC | 447 ms
114,744 KB |
testcase_23 | AC | 442 ms
118,420 KB |
testcase_24 | AC | 489 ms
118,692 KB |
testcase_25 | AC | 421 ms
113,272 KB |
testcase_26 | AC | 425 ms
111,792 KB |
testcase_27 | AC | 966 ms
106,980 KB |
testcase_28 | AC | 454 ms
125,088 KB |
testcase_29 | AC | 488 ms
131,524 KB |
testcase_30 | AC | 478 ms
117,000 KB |
testcase_31 | AC | 499 ms
117,272 KB |
testcase_32 | AC | 440 ms
112,864 KB |
testcase_33 | AC | 452 ms
114,604 KB |
testcase_34 | AC | 132 ms
91,888 KB |
testcase_35 | AC | 252 ms
93,292 KB |
testcase_36 | AC | 438 ms
114,016 KB |
testcase_37 | AC | 484 ms
118,484 KB |
testcase_38 | AC | 473 ms
119,768 KB |
testcase_39 | AC | 468 ms
109,472 KB |
testcase_40 | AC | 491 ms
113,376 KB |
testcase_41 | AC | 464 ms
114,888 KB |
testcase_42 | AC | 317 ms
94,664 KB |
testcase_43 | AC | 202 ms
92,872 KB |
testcase_44 | AC | 337 ms
98,100 KB |
testcase_45 | AC | 316 ms
131,768 KB |
testcase_46 | AC | 184 ms
114,704 KB |
testcase_47 | AC | 164 ms
95,132 KB |
testcase_48 | AC | 247 ms
121,052 KB |
testcase_49 | AC | 253 ms
105,916 KB |
testcase_50 | AC | 228 ms
110,628 KB |
testcase_51 | AC | 151 ms
93,020 KB |
testcase_52 | AC | 173 ms
103,372 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 self.seen = [0] * N 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, s] while stack: u = stack.pop() if u >= 0: self.used1[u] = 1 for v in self.G[u]: if self.used1[v]: continue stack.append(~v) stack.append(v) else: u = ~u if self.seen[u]: continue self.seen[u]= 1 self.order.append(u) def rdfs(self, s, num): stack = [s] while stack: u = stack.pop() if u >= 0: self.used2[u] = 1 self.group[u] = num 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")