結果
問題 | No.1023 Cyclic Tour |
ユーザー | ああいい |
提出日時 | 2022-01-28 00:10:21 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,291 bytes |
コンパイル時間 | 1,621 ms |
コンパイル使用メモリ | 87,044 KB |
実行使用メモリ | 161,816 KB |
最終ジャッジ日時 | 2023-08-27 02:52:49 |
合計ジャッジ時間 | 37,725 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 84 ms
71,768 KB |
testcase_01 | AC | 82 ms
71,616 KB |
testcase_02 | AC | 82 ms
71,604 KB |
testcase_03 | AC | 80 ms
71,800 KB |
testcase_04 | AC | 479 ms
122,976 KB |
testcase_05 | AC | 520 ms
123,144 KB |
testcase_06 | AC | 535 ms
129,172 KB |
testcase_07 | AC | 486 ms
127,004 KB |
testcase_08 | AC | 528 ms
130,132 KB |
testcase_09 | AC | 526 ms
128,600 KB |
testcase_10 | AC | 519 ms
128,844 KB |
testcase_11 | AC | 545 ms
135,956 KB |
testcase_12 | AC | 450 ms
139,012 KB |
testcase_13 | AC | 443 ms
133,980 KB |
testcase_14 | AC | 440 ms
131,584 KB |
testcase_15 | AC | 456 ms
133,788 KB |
testcase_16 | AC | 668 ms
135,652 KB |
testcase_17 | AC | 668 ms
137,756 KB |
testcase_18 | AC | 670 ms
136,104 KB |
testcase_19 | AC | 649 ms
133,328 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 841 ms
139,164 KB |
testcase_23 | AC | 823 ms
140,796 KB |
testcase_24 | AC | 723 ms
149,440 KB |
testcase_25 | AC | 734 ms
135,740 KB |
testcase_26 | AC | 703 ms
137,540 KB |
testcase_27 | AC | 632 ms
140,440 KB |
testcase_28 | AC | 676 ms
144,312 KB |
testcase_29 | AC | 645 ms
152,056 KB |
testcase_30 | AC | 712 ms
147,612 KB |
testcase_31 | AC | 691 ms
144,408 KB |
testcase_32 | AC | 687 ms
139,584 KB |
testcase_33 | AC | 746 ms
146,348 KB |
testcase_34 | AC | 731 ms
133,628 KB |
testcase_35 | AC | 735 ms
135,488 KB |
testcase_36 | WA | - |
testcase_37 | AC | 728 ms
137,900 KB |
testcase_38 | AC | 653 ms
145,800 KB |
testcase_39 | WA | - |
testcase_40 | AC | 719 ms
141,200 KB |
testcase_41 | AC | 712 ms
140,520 KB |
testcase_42 | AC | 708 ms
136,984 KB |
testcase_43 | AC | 645 ms
142,772 KB |
testcase_44 | AC | 467 ms
123,868 KB |
testcase_45 | AC | 354 ms
140,480 KB |
testcase_46 | AC | 355 ms
126,076 KB |
testcase_47 | AC | 397 ms
132,716 KB |
testcase_48 | AC | 557 ms
160,064 KB |
testcase_49 | AC | 608 ms
152,340 KB |
testcase_50 | AC | 562 ms
161,816 KB |
testcase_51 | AC | 567 ms
159,704 KB |
testcase_52 | AC | 538 ms
154,844 KB |
ソースコード
import sys r = sys.stdin N,M = map(int,r.readline().split()) G = [[] for _ in range(N+1)] rG = [[] for _ in range(N+1)] edge = [] for _ in range(M): a,b,c = map(int,r.readline().split()) G[a].append(b) rG[b].append(a) if c == 1: G[b].append(a) rG[a].append(b) edge.append((a,b,c)) order = [] memo = [0] * (N + 1) sys.setrecursionlimit(10 ** 8) """ def dfs(now): memo[now] = 1 for v in G[now]: if memo[v] == 0: dfs(v) order.append(now) for i in range(1,N+1): if memo[i] == 0: dfs(i) """ def dfs(now): stack = [now] memo[now] = 1 while stack: i = stack.pop() if memo[i] == 1: memo[i] = 2 stack.append(i) for v in G[i]: if memo[v] == 0: memo[v] = 1 stack.append(v) else: order.append(i) for i in range(1,N+1): if memo[i] == 0: dfs(i) l = [] memo = [0] * (N + 1) """ def dfs2(now,s): memo[i] = 1 s.append(i) for v in rG[now]: if memo[v] == 0: dfs2(v,s) for i in order[::-1]: if memo[i] == 0: l.append([]) dfs2(i,l[-1]) """ def dfs2(now,s): memo[now] = 1 stack = [now] while stack: i = stack.pop() s.append(i) for v in rG[i]: if memo[v] == 0: memo[v] = 1 stack.append(v) for i in order[::-1]: if memo[i] == 0: l.append([]) dfs2(i,l[-1]) parent = list(range(N+1)) def find(i): """ if parent[i] == i:return i parent[i] = find(parent[i]) return parent[i] """ ll = [] while parent[i] != i: ll.append(i) i = parent[i] for v in ll: parent[v] = i return i def unite(i,j): I = find(i) J = find(j) if I == J:return False parent[I] = J parent[i] = J return True def isSame(i,j): return find(i) == find(j) from collections import defaultdict d = defaultdict(int) for s in l: v = s[0] for u in s: unite(v,u) for a,b,c in edge: if isSame(a,b): d[find(a)] += 1 for s in l: if len(s) <= d[find(s[0])]: print('Yes') exit() print('No')