結果

問題 No.2072 Anatomy
ユーザー lloyz
提出日時 2022-09-18 13:43:14
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 535 ms / 2,000 ms
コード長 2,405 bytes
コンパイル時間 259 ms
コンパイル使用メモリ 82,440 KB
実行使用メモリ 94,404 KB
最終ジャッジ日時 2024-12-22 01:16:38
合計ジャッジ時間 8,769 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from collections import defaultdict
class UnionFind():
def __init__(self, n):
'''
UnionFindn
'''
self.n = n
self.parents = [-1] * n
def find(self, x):
'''
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):
'''
xy
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
def size(self, x):
'''
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())
n, m = map(int, input().split())
UF = UnionFind(n)
RootCnt = [0 for _ in range(n)]
Edges = []
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
Edges.append((u, v))
Edges.reverse()
ans = 0
for i in range(m):
u, v = Edges[i]
if UF.same(u, v):
root = UF.find(u)
RootCnt[root] += 1
ans = max(ans, RootCnt[root])
else:
uroot = UF.find(u)
vroot = UF.find(v)
cnt = max(RootCnt[uroot], RootCnt[vroot]) + 1
ans = max(ans, cnt)
UF.union(u, v)
root = UF.find(u)
RootCnt[root] = cnt
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0