結果
問題 | No.2072 Anatomy |
ユーザー | tassei903 |
提出日時 | 2022-09-19 13:13:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 465 ms / 2,000 ms |
コード長 | 2,106 bytes |
コンパイル時間 | 1,047 ms |
コンパイル使用メモリ | 86,256 KB |
実行使用メモリ | 101,504 KB |
最終ジャッジ日時 | 2023-08-23 18:51:46 |
合計ジャッジ時間 | 9,381 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
71,292 KB |
testcase_01 | AC | 89 ms
71,520 KB |
testcase_02 | AC | 95 ms
71,792 KB |
testcase_03 | AC | 100 ms
76,180 KB |
testcase_04 | AC | 97 ms
71,892 KB |
testcase_05 | AC | 102 ms
75,956 KB |
testcase_06 | AC | 98 ms
72,160 KB |
testcase_07 | AC | 102 ms
76,340 KB |
testcase_08 | AC | 465 ms
98,320 KB |
testcase_09 | AC | 222 ms
94,960 KB |
testcase_10 | AC | 377 ms
97,812 KB |
testcase_11 | AC | 306 ms
98,316 KB |
testcase_12 | AC | 260 ms
92,208 KB |
testcase_13 | AC | 356 ms
99,648 KB |
testcase_14 | AC | 346 ms
90,776 KB |
testcase_15 | AC | 208 ms
88,512 KB |
testcase_16 | AC | 383 ms
100,564 KB |
testcase_17 | AC | 272 ms
97,836 KB |
testcase_18 | AC | 202 ms
87,536 KB |
testcase_19 | AC | 355 ms
99,752 KB |
testcase_20 | AC | 437 ms
101,400 KB |
testcase_21 | AC | 225 ms
97,948 KB |
testcase_22 | AC | 361 ms
100,012 KB |
testcase_23 | AC | 227 ms
97,784 KB |
testcase_24 | AC | 220 ms
97,744 KB |
testcase_25 | AC | 334 ms
99,244 KB |
testcase_26 | AC | 88 ms
71,168 KB |
testcase_27 | AC | 226 ms
97,840 KB |
testcase_28 | AC | 411 ms
101,504 KB |
ソースコード
import sys input = lambda :sys.stdin.readline()[:-1] ni = lambda :int(input()) na = lambda :list(map(int,input().split())) yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES") no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO") ####################################################################### from collections import defaultdict class UnionFind2(): def __init__(self, n, e, f): self.n = n self.parents = [-1] * n self.a = [e] * n self.f = f 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 if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x self.a[x] = self.f(self.a[x], self.a[y]) self.a[y] = e 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 len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) e = 0 def f(x, y): return max(x, y) + 1 n, m = na() E = [] for i in range(m): u, v = na() u-=1 v-=1 E.append((u, v)) uf = UnionFind2(n, e, f) for u, v in E[::-1]: if uf.same(u, v): uf.a[uf.find(u)] += 1 else: uf.union(u, v) print(max([uf.a[x] for x in range(n)]))