結果
問題 | No.1254 補強への架け橋 |
ユーザー | 👑 rin204 |
提出日時 | 2022-01-27 22:20:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 545 ms / 2,000 ms |
コード長 | 2,177 bytes |
コンパイル時間 | 1,147 ms |
コンパイル使用メモリ | 87,084 KB |
実行使用メモリ | 112,392 KB |
最終ジャッジ日時 | 2023-08-27 00:39:03 |
合計ジャッジ時間 | 33,165 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
71,008 KB |
testcase_01 | AC | 67 ms
71,160 KB |
testcase_02 | AC | 68 ms
71,476 KB |
testcase_03 | AC | 68 ms
71,160 KB |
testcase_04 | AC | 69 ms
71,332 KB |
testcase_05 | AC | 67 ms
71,160 KB |
testcase_06 | AC | 68 ms
71,292 KB |
testcase_07 | AC | 69 ms
71,320 KB |
testcase_08 | AC | 70 ms
71,280 KB |
testcase_09 | AC | 69 ms
71,280 KB |
testcase_10 | AC | 67 ms
71,304 KB |
testcase_11 | AC | 68 ms
71,328 KB |
testcase_12 | AC | 69 ms
71,172 KB |
testcase_13 | AC | 69 ms
71,340 KB |
testcase_14 | AC | 69 ms
71,180 KB |
testcase_15 | AC | 68 ms
71,280 KB |
testcase_16 | AC | 69 ms
71,260 KB |
testcase_17 | AC | 69 ms
71,308 KB |
testcase_18 | AC | 67 ms
71,008 KB |
testcase_19 | AC | 68 ms
71,284 KB |
testcase_20 | AC | 67 ms
71,308 KB |
testcase_21 | AC | 69 ms
71,296 KB |
testcase_22 | AC | 69 ms
71,036 KB |
testcase_23 | AC | 68 ms
71,320 KB |
testcase_24 | AC | 71 ms
71,224 KB |
testcase_25 | AC | 70 ms
71,312 KB |
testcase_26 | AC | 70 ms
71,384 KB |
testcase_27 | AC | 70 ms
71,124 KB |
testcase_28 | AC | 70 ms
71,100 KB |
testcase_29 | AC | 69 ms
71,376 KB |
testcase_30 | AC | 71 ms
71,116 KB |
testcase_31 | AC | 70 ms
71,308 KB |
testcase_32 | AC | 69 ms
71,256 KB |
testcase_33 | AC | 70 ms
71,032 KB |
testcase_34 | AC | 70 ms
71,032 KB |
testcase_35 | AC | 69 ms
71,532 KB |
testcase_36 | AC | 69 ms
71,032 KB |
testcase_37 | AC | 71 ms
71,384 KB |
testcase_38 | AC | 71 ms
71,388 KB |
testcase_39 | AC | 69 ms
71,028 KB |
testcase_40 | AC | 71 ms
71,568 KB |
testcase_41 | AC | 76 ms
71,016 KB |
testcase_42 | AC | 70 ms
71,224 KB |
testcase_43 | AC | 92 ms
76,512 KB |
testcase_44 | AC | 79 ms
75,688 KB |
testcase_45 | AC | 76 ms
75,304 KB |
testcase_46 | AC | 88 ms
76,196 KB |
testcase_47 | AC | 80 ms
75,340 KB |
testcase_48 | AC | 86 ms
76,228 KB |
testcase_49 | AC | 71 ms
71,224 KB |
testcase_50 | AC | 90 ms
76,616 KB |
testcase_51 | AC | 92 ms
76,340 KB |
testcase_52 | AC | 92 ms
76,460 KB |
testcase_53 | AC | 86 ms
76,356 KB |
testcase_54 | AC | 90 ms
76,732 KB |
testcase_55 | AC | 89 ms
76,188 KB |
testcase_56 | AC | 72 ms
71,284 KB |
testcase_57 | AC | 86 ms
76,132 KB |
testcase_58 | AC | 82 ms
76,096 KB |
testcase_59 | AC | 70 ms
71,128 KB |
testcase_60 | AC | 75 ms
75,216 KB |
testcase_61 | AC | 88 ms
76,492 KB |
testcase_62 | AC | 71 ms
71,128 KB |
testcase_63 | AC | 193 ms
80,240 KB |
testcase_64 | AC | 137 ms
79,252 KB |
testcase_65 | AC | 172 ms
80,500 KB |
testcase_66 | AC | 160 ms
80,436 KB |
testcase_67 | AC | 122 ms
79,056 KB |
testcase_68 | AC | 167 ms
80,440 KB |
testcase_69 | AC | 190 ms
81,664 KB |
testcase_70 | AC | 137 ms
79,200 KB |
testcase_71 | AC | 128 ms
79,220 KB |
testcase_72 | AC | 191 ms
81,240 KB |
testcase_73 | AC | 139 ms
79,340 KB |
testcase_74 | AC | 178 ms
80,752 KB |
testcase_75 | AC | 173 ms
80,432 KB |
testcase_76 | AC | 108 ms
79,032 KB |
testcase_77 | AC | 159 ms
80,332 KB |
testcase_78 | AC | 193 ms
81,368 KB |
testcase_79 | AC | 193 ms
80,696 KB |
testcase_80 | AC | 183 ms
80,916 KB |
testcase_81 | AC | 221 ms
82,400 KB |
testcase_82 | AC | 186 ms
80,948 KB |
testcase_83 | AC | 443 ms
98,508 KB |
testcase_84 | AC | 508 ms
100,596 KB |
testcase_85 | AC | 401 ms
92,812 KB |
testcase_86 | AC | 426 ms
96,564 KB |
testcase_87 | AC | 427 ms
98,188 KB |
testcase_88 | AC | 207 ms
81,188 KB |
testcase_89 | AC | 524 ms
100,860 KB |
testcase_90 | AC | 398 ms
93,208 KB |
testcase_91 | AC | 317 ms
90,596 KB |
testcase_92 | AC | 254 ms
83,852 KB |
testcase_93 | AC | 394 ms
95,584 KB |
testcase_94 | AC | 406 ms
95,780 KB |
testcase_95 | AC | 393 ms
95,060 KB |
testcase_96 | AC | 458 ms
100,008 KB |
testcase_97 | AC | 343 ms
89,840 KB |
testcase_98 | AC | 509 ms
100,456 KB |
testcase_99 | AC | 413 ms
93,184 KB |
testcase_100 | AC | 511 ms
101,176 KB |
testcase_101 | AC | 266 ms
84,712 KB |
testcase_102 | AC | 204 ms
80,932 KB |
testcase_103 | AC | 253 ms
84,652 KB |
testcase_104 | AC | 303 ms
87,736 KB |
testcase_105 | AC | 385 ms
96,444 KB |
testcase_106 | AC | 337 ms
90,096 KB |
testcase_107 | AC | 437 ms
99,164 KB |
testcase_108 | AC | 427 ms
99,464 KB |
testcase_109 | AC | 449 ms
97,980 KB |
testcase_110 | AC | 382 ms
95,040 KB |
testcase_111 | AC | 366 ms
95,420 KB |
testcase_112 | AC | 318 ms
87,444 KB |
testcase_113 | AC | 412 ms
95,328 KB |
testcase_114 | AC | 327 ms
89,812 KB |
testcase_115 | AC | 248 ms
81,704 KB |
testcase_116 | AC | 328 ms
90,876 KB |
testcase_117 | AC | 289 ms
86,400 KB |
testcase_118 | AC | 457 ms
98,860 KB |
testcase_119 | AC | 372 ms
92,008 KB |
testcase_120 | AC | 456 ms
98,748 KB |
testcase_121 | AC | 259 ms
84,380 KB |
testcase_122 | AC | 341 ms
91,660 KB |
testcase_123 | AC | 69 ms
71,132 KB |
testcase_124 | AC | 527 ms
112,392 KB |
testcase_125 | AC | 545 ms
111,180 KB |
ソースコード
class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n self.group = n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return self.group -= 1 if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return self.group def all_group_members(self): dic = {r:[] for r in self.roots()} for i in range(self.n): dic[self.find(i)].append(i) return dic def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) n = int(input()) edges = [[] for _ in range(n)] UF = UnionFind(n) for i in range(1, n + 1): a, b = map(int, input().split()) a -= 1 b -= 1 if UF.same(a, b): aa, bb, ii = a, b, i else: UF.union(a, b) edges[a].append((b, i)) edges[b].append((a, i)) used = [False] * n used[0] = True stack = [0] parent = [-1] * n bind = [-1] * n dist = [0] * n while stack: pos = stack.pop() for npos, i in edges[pos]: if used[npos]: continue used[npos] = True bind[npos] = i dist[npos] = dist[pos] + 1 parent[npos] = pos stack.append(npos) ans = [ii] if dist[aa] < dist[bb]: aa, bb = bb, aa while dist[aa] != dist[bb]: ans.append(bind[aa]) aa = parent[aa] while aa != bb: ans.append(bind[aa]) aa = parent[aa] ans.append(bind[bb]) bb = parent[bb] print(len(ans)) print(*ans)