結果

問題 No.1293 2種類の道路
ユーザー 👑 SPD_9X2
提出日時 2020-11-20 22:18:42
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 307 ms / 2,000 ms
コード長 2,021 bytes
コンパイル時間 189 ms
コンパイル使用メモリ 82,012 KB
実行使用メモリ 112,804 KB
最終ジャッジ日時 2024-07-23 13:15:00
合計ジャッジ時間 5,319 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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

"""
union-find
N**2
X1,X2
DX1
N
dictO(NlogN)
"""
from sys import stdin
def uf_find(n,p):
ufl = []
while p[n] != n:
ufl.append(n)
n = p[n]
for i in ufl:
p[i] = n
return n
def uf_union(a,b,p,rank):
ap = uf_find(a,p)
bp = uf_find(b,p)
if ap == bp:
return False
else:
if rank[ap] > rank[bp]:
p[bp] = ap
rank[ap] += rank[bp]
else:
p[ap] = bp
rank[bp] += rank[ap]
return True
N,D,W = map(int,stdin.readline().split())
ab = []
for i in range(D):
a,b = map(int,stdin.readline().split())
ab.append((a-1,b-1))
cd = []
for i in range(W):
c,d = map(int,stdin.readline().split())
cd.append((c-1,d-1))
p1 = [i for i in range(N)]
rank1 = [1] * N
for a,b in ab:
uf_union(a,b,p1,rank1)
p2 = [i for i in range(N)]
rank2 = [1] * N
for c,d in cd:
uf_union(c,d,p2,rank2)
ans = 0
ch = [ {} for i in range(N) ]
for i in range(N):
underP = uf_find(i,p2)
ch[uf_find(i,p1)][underP] = rank2[underP]
#print (ch)
ans = 0
for i in range(N):
if len(ch[i]) > 0:
tsum = 0
for key in ch[i]:
tsum += ch[i][key]
ans += rank1[i] * tsum
print (ans - N)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0