結果

問題 No.1390 Get together
ユーザー lloyzlloyz
提出日時 2022-03-20 00:20:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 471 ms / 2,000 ms
コード長 2,231 bytes
コンパイル時間 203 ms
コンパイル使用メモリ 82,148 KB
実行使用メモリ 124,124 KB
最終ジャッジ日時 2024-10-05 12:46:36
合計ジャッジ時間 11,385 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

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())
B = defaultdict(list)
C = defaultdict(list)
for i in range(n):
b, c = map(int, input().split())
B[b].append(i)
C[c].append(i)
UF = UnionFind(n)
for BB in B.values():
f = BB[0]
for j in BB[1:]:
UF.union(f, j)
ans = 0
for CC in C.values():
f = CC[0]
for j in CC[1:]:
if UF.same(f, j):
continue
ans += 1
UF.union(f, j)
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0