結果
問題 | No.1023 Cyclic Tour |
ユーザー | rlangevin |
提出日時 | 2024-02-03 01:38:31 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 935 ms / 2,000 ms |
コード長 | 3,046 bytes |
コンパイル時間 | 348 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 262,532 KB |
最終ジャッジ日時 | 2024-02-03 01:38:59 |
合計ジャッジ時間 | 24,355 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
53,460 KB |
testcase_01 | AC | 33 ms
53,460 KB |
testcase_02 | AC | 37 ms
53,460 KB |
testcase_03 | AC | 32 ms
53,460 KB |
testcase_04 | AC | 271 ms
90,676 KB |
testcase_05 | AC | 257 ms
91,212 KB |
testcase_06 | AC | 253 ms
91,692 KB |
testcase_07 | AC | 236 ms
91,328 KB |
testcase_08 | AC | 186 ms
92,252 KB |
testcase_09 | AC | 404 ms
118,844 KB |
testcase_10 | AC | 402 ms
106,960 KB |
testcase_11 | AC | 398 ms
111,680 KB |
testcase_12 | AC | 394 ms
127,152 KB |
testcase_13 | AC | 380 ms
119,224 KB |
testcase_14 | AC | 371 ms
118,136 KB |
testcase_15 | AC | 367 ms
114,748 KB |
testcase_16 | AC | 935 ms
222,056 KB |
testcase_17 | AC | 875 ms
217,656 KB |
testcase_18 | AC | 714 ms
159,360 KB |
testcase_19 | AC | 687 ms
160,256 KB |
testcase_20 | AC | 347 ms
111,304 KB |
testcase_21 | AC | 351 ms
110,912 KB |
testcase_22 | AC | 416 ms
108,404 KB |
testcase_23 | AC | 416 ms
119,532 KB |
testcase_24 | AC | 432 ms
118,964 KB |
testcase_25 | AC | 391 ms
111,896 KB |
testcase_26 | AC | 348 ms
108,624 KB |
testcase_27 | AC | 316 ms
105,452 KB |
testcase_28 | AC | 448 ms
123,084 KB |
testcase_29 | AC | 447 ms
131,260 KB |
testcase_30 | AC | 437 ms
123,684 KB |
testcase_31 | AC | 450 ms
122,516 KB |
testcase_32 | AC | 553 ms
169,396 KB |
testcase_33 | AC | 554 ms
156,972 KB |
testcase_34 | AC | 138 ms
91,168 KB |
testcase_35 | AC | 223 ms
92,520 KB |
testcase_36 | AC | 388 ms
111,964 KB |
testcase_37 | AC | 499 ms
135,624 KB |
testcase_38 | AC | 462 ms
128,060 KB |
testcase_39 | AC | 430 ms
107,700 KB |
testcase_40 | AC | 469 ms
120,908 KB |
testcase_41 | AC | 451 ms
123,700 KB |
testcase_42 | AC | 279 ms
94,012 KB |
testcase_43 | AC | 183 ms
92,240 KB |
testcase_44 | AC | 257 ms
99,452 KB |
testcase_45 | AC | 481 ms
232,964 KB |
testcase_46 | AC | 559 ms
262,532 KB |
testcase_47 | AC | 152 ms
97,864 KB |
testcase_48 | AC | 221 ms
121,520 KB |
testcase_49 | AC | 211 ms
118,032 KB |
testcase_50 | AC | 190 ms
125,968 KB |
testcase_51 | AC | 138 ms
92,208 KB |
testcase_52 | AC | 152 ms
102,688 KB |
ソースコード
import sys input = sys.stdin.readline sys.setrecursionlimit(10**7) 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 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")