結果

問題 No.1293 2種類の道路
ユーザー None
提出日時 2021-03-18 03:34:34
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 305 ms / 2,000 ms
コード長 2,781 bytes
コンパイル時間 193 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 110,080 KB
最終ジャッジ日時 2024-11-15 21:26:02
合計ジャッジ時間 6,572 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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

class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
""" (x)"""
tmp = []
parents = self.parents
while parents[x] >= 0:
tmp.append(x)
x = parents[x]
for y in tmp:
parents[y] = x
return 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
def same(self, x, y):
""" xy """
return self.find(x) == self.find(y)
def size(self, x):
""" xparent(= ) """
return -self.parents[self.find(x)]
def members(self, x):
""" x O(N)"""
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
""" O(N)"""
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
""" O(N)"""
return len(self.roots())
def size_list(self):
""" () O(N)"""
return [-x for x in self.parents if x < 0]
def all_group_members(self):
""" {:[()],...} O(N)"""
res = [[] for _ in range(self.n)]
for i in range(self.n):
x = self.find(i)
res[x].append(i)
return {r: res[r] for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
##############################################################################################################
import sys
input = sys.stdin.readline
N,D,W=map(int, input().split())
U = UnionFind(N)
V = UnionFind(N)
for _ in range(D):
a,b=map(int, input().split())
U.union(a-1,b-1)
for _ in range(W):
a,b=map(int, input().split())
V.union(a-1,b-1)
res=0
for root, mem in U.all_group_members().items():
used=set()
cnt2=0
cnt1=len(mem)
for i in mem:
root2=V.find(i)
if root2 not in used:
size=V.size(i)
cnt2+=size
used.add(root2)
res+=cnt1*(cnt1-1)
res+=cnt1*(cnt2-cnt1)
print(res)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0