結果
問題 | No.1254 補強への架け橋 |
ユーザー | 👑 tamato |
提出日時 | 2020-10-09 22:05:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 393 ms / 2,000 ms |
コード長 | 2,066 bytes |
コンパイル時間 | 331 ms |
コンパイル使用メモリ | 87,664 KB |
実行使用メモリ | 125,740 KB |
最終ジャッジ日時 | 2023-09-27 17:14:16 |
合計ジャッジ時間 | 29,269 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 86 ms
71,940 KB |
testcase_01 | AC | 90 ms
72,128 KB |
testcase_02 | AC | 85 ms
71,808 KB |
testcase_03 | AC | 82 ms
72,096 KB |
testcase_04 | AC | 82 ms
71,712 KB |
testcase_05 | AC | 85 ms
71,812 KB |
testcase_06 | AC | 87 ms
71,712 KB |
testcase_07 | AC | 87 ms
71,648 KB |
testcase_08 | AC | 83 ms
71,872 KB |
testcase_09 | AC | 87 ms
72,036 KB |
testcase_10 | AC | 86 ms
71,896 KB |
testcase_11 | AC | 85 ms
71,708 KB |
testcase_12 | AC | 85 ms
71,860 KB |
testcase_13 | AC | 82 ms
72,000 KB |
testcase_14 | AC | 85 ms
71,720 KB |
testcase_15 | AC | 86 ms
71,728 KB |
testcase_16 | AC | 89 ms
71,908 KB |
testcase_17 | AC | 86 ms
71,732 KB |
testcase_18 | AC | 83 ms
72,004 KB |
testcase_19 | AC | 85 ms
72,132 KB |
testcase_20 | AC | 84 ms
71,728 KB |
testcase_21 | AC | 87 ms
71,916 KB |
testcase_22 | AC | 88 ms
71,996 KB |
testcase_23 | AC | 84 ms
72,004 KB |
testcase_24 | AC | 83 ms
72,192 KB |
testcase_25 | AC | 85 ms
71,728 KB |
testcase_26 | AC | 85 ms
71,976 KB |
testcase_27 | AC | 89 ms
72,052 KB |
testcase_28 | AC | 85 ms
71,856 KB |
testcase_29 | AC | 84 ms
72,052 KB |
testcase_30 | AC | 87 ms
71,952 KB |
testcase_31 | AC | 81 ms
72,000 KB |
testcase_32 | AC | 83 ms
72,080 KB |
testcase_33 | AC | 87 ms
72,028 KB |
testcase_34 | AC | 82 ms
71,864 KB |
testcase_35 | AC | 84 ms
72,056 KB |
testcase_36 | AC | 83 ms
71,812 KB |
testcase_37 | AC | 86 ms
72,004 KB |
testcase_38 | AC | 87 ms
71,992 KB |
testcase_39 | AC | 91 ms
72,092 KB |
testcase_40 | AC | 85 ms
72,004 KB |
testcase_41 | AC | 85 ms
72,068 KB |
testcase_42 | AC | 83 ms
72,016 KB |
testcase_43 | AC | 96 ms
77,080 KB |
testcase_44 | AC | 95 ms
76,768 KB |
testcase_45 | AC | 89 ms
76,692 KB |
testcase_46 | AC | 93 ms
76,784 KB |
testcase_47 | AC | 91 ms
76,572 KB |
testcase_48 | AC | 90 ms
76,836 KB |
testcase_49 | AC | 85 ms
72,052 KB |
testcase_50 | AC | 97 ms
77,252 KB |
testcase_51 | AC | 97 ms
77,188 KB |
testcase_52 | AC | 99 ms
76,960 KB |
testcase_53 | AC | 95 ms
77,116 KB |
testcase_54 | AC | 97 ms
77,040 KB |
testcase_55 | AC | 99 ms
77,256 KB |
testcase_56 | AC | 84 ms
72,004 KB |
testcase_57 | AC | 97 ms
77,012 KB |
testcase_58 | AC | 95 ms
76,840 KB |
testcase_59 | AC | 82 ms
71,712 KB |
testcase_60 | AC | 88 ms
76,800 KB |
testcase_61 | AC | 96 ms
77,004 KB |
testcase_62 | AC | 83 ms
71,920 KB |
testcase_63 | AC | 172 ms
81,324 KB |
testcase_64 | AC | 121 ms
78,836 KB |
testcase_65 | AC | 153 ms
79,348 KB |
testcase_66 | AC | 144 ms
79,544 KB |
testcase_67 | AC | 116 ms
78,756 KB |
testcase_68 | AC | 145 ms
79,592 KB |
testcase_69 | AC | 156 ms
80,120 KB |
testcase_70 | AC | 134 ms
79,452 KB |
testcase_71 | AC | 114 ms
78,808 KB |
testcase_72 | AC | 161 ms
80,872 KB |
testcase_73 | AC | 123 ms
79,040 KB |
testcase_74 | AC | 152 ms
80,408 KB |
testcase_75 | AC | 144 ms
79,396 KB |
testcase_76 | AC | 110 ms
78,180 KB |
testcase_77 | AC | 143 ms
79,288 KB |
testcase_78 | AC | 170 ms
81,352 KB |
testcase_79 | AC | 170 ms
81,396 KB |
testcase_80 | AC | 166 ms
80,972 KB |
testcase_81 | AC | 170 ms
81,240 KB |
testcase_82 | AC | 172 ms
80,700 KB |
testcase_83 | AC | 363 ms
104,608 KB |
testcase_84 | AC | 368 ms
102,600 KB |
testcase_85 | AC | 272 ms
94,320 KB |
testcase_86 | AC | 343 ms
101,244 KB |
testcase_87 | AC | 333 ms
102,220 KB |
testcase_88 | AC | 179 ms
81,584 KB |
testcase_89 | AC | 358 ms
104,352 KB |
testcase_90 | AC | 292 ms
94,360 KB |
testcase_91 | AC | 268 ms
92,464 KB |
testcase_92 | AC | 206 ms
84,844 KB |
testcase_93 | AC | 303 ms
98,488 KB |
testcase_94 | AC | 300 ms
97,988 KB |
testcase_95 | AC | 307 ms
97,568 KB |
testcase_96 | AC | 342 ms
102,272 KB |
testcase_97 | AC | 248 ms
89,196 KB |
testcase_98 | AC | 362 ms
102,848 KB |
testcase_99 | AC | 274 ms
93,588 KB |
testcase_100 | AC | 393 ms
107,644 KB |
testcase_101 | AC | 209 ms
85,524 KB |
testcase_102 | AC | 173 ms
81,880 KB |
testcase_103 | AC | 197 ms
85,840 KB |
testcase_104 | AC | 217 ms
88,396 KB |
testcase_105 | AC | 298 ms
98,352 KB |
testcase_106 | AC | 227 ms
89,764 KB |
testcase_107 | AC | 361 ms
104,480 KB |
testcase_108 | AC | 367 ms
105,000 KB |
testcase_109 | AC | 312 ms
98,020 KB |
testcase_110 | AC | 305 ms
97,532 KB |
testcase_111 | AC | 296 ms
97,680 KB |
testcase_112 | AC | 224 ms
88,480 KB |
testcase_113 | AC | 290 ms
97,592 KB |
testcase_114 | AC | 224 ms
89,924 KB |
testcase_115 | AC | 175 ms
81,896 KB |
testcase_116 | AC | 252 ms
93,232 KB |
testcase_117 | AC | 214 ms
88,176 KB |
testcase_118 | AC | 328 ms
101,736 KB |
testcase_119 | AC | 253 ms
93,188 KB |
testcase_120 | AC | 316 ms
102,192 KB |
testcase_121 | AC | 197 ms
86,004 KB |
testcase_122 | AC | 231 ms
92,720 KB |
testcase_123 | AC | 82 ms
72,056 KB |
testcase_124 | AC | 386 ms
125,728 KB |
testcase_125 | AC | 376 ms
125,740 KB |
ソースコード
mod = 1000000007 eps = 10**-9 def main(): import sys from collections import deque input = sys.stdin.buffer.readline class UnionFind(): def __init__(self, n): self.n = n self.root = [-1] * (n + 1) self.rnk = [0] * (n + 1) def find_root(self, x): while self.root[x] >= 0: x = self.root[x] return x def unite(self, x, y): x = self.find_root(x) y = self.find_root(y) if x == y: return elif self.rnk[x] > self.rnk[y]: self.root[x] += self.root[y] self.root[y] = x else: self.root[y] += self.root[x] self.root[x] = y if self.rnk[x] == self.rnk[y]: self.rnk[y] += 1 def isSameGroup(self, x, y): return self.find_root(x) == self.find_root(y) def size(self, x): return -self.root[self.find_root(x)] N = int(input()) E = [] UF = UnionFind(N) aa = bb = 0 ii = N+1 adj = [[] for _ in range(N+1)] for i in range(1, N+1): a, b = map(int, input().split()) E.append((a, b)) if UF.isSameGroup(a, b): aa = a bb = b ii = i else: UF.unite(a, b) adj[a].append((b, i)) adj[b].append((a, i)) que = deque() que.append(1) seen = [-1] * (N+1) seen[1] = 0 par = [0] * (N+1) while que: v = que.popleft() for u, e in adj[v]: if seen[u] == -1: seen[u] = seen[v] + 1 par[u] = (v, e) que.append(u) ans = {ii} v = aa while v != 1: p, e = par[v] ans.add(e) v = p v = bb while v != 1: p, e = par[v] if e in ans: ans.discard(e) else: ans.add(e) v = p print(len(ans)) print(*ans) if __name__ == '__main__': main()