結果

問題 No.1293 2種類の道路
ユーザー mkawa2
提出日時 2021-09-06 16:41:41
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 1,152 ms / 2,000 ms
コード長 2,190 bytes
コンパイル時間 673 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 44,216 KB
最終ジャッジ日時 2024-12-22 19:16:56
合計ジャッジ時間 16,664 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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

import sys
# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**20
# md = 998244353
md = 10**9+7
class UnionFind:
def __init__(self, n):
self.table = [-1]*n
self.mem = [[u] for u in range(n)]
self.cnt = n
def root(self, u):
stack = []
while self.table[u] >= 0:
stack.append(u)
u = self.table[u]
for v in stack: self.table[v] = u
return u
def same(self, u, v):
return self.root(u) == self.root(v)
def merge(self, u, v):
u = self.root(u)
v = self.root(v)
if u == v: return False
su = -self.table[u]
sv = -self.table[v]
if su < sv: u, v = v, u
self.table[u] = -su-sv
self.table[v] = u
self.mem[u] += self.mem[v]
self.mem[v].clear()
self.cnt -= 1
return True
def member(self, u):
return self.mem[self.root(u)]
#
def size(self, u):
return -self.table[self.root(u)]
from collections import Counter
n, d, w = LI()
uf1 = UnionFind(n)
uf2 = UnionFind(n)
for _ in range(d):
u, v = LI1()
uf1.merge(u, v)
for _ in range(w):
u, v = LI1()
uf2.merge(u, v)
ans = 0
fin1 = [False]*n
fin2 = [False]*n
for u in range(n):
u = uf1.root(u)
if fin1[u]: continue
fin1[u] = True
cnt = Counter()
for v in uf1.member(u):
r = uf2.root(v)
cnt[r] += 1
v = uf2.root(v)
s1=uf1.size(u)
ans+=s1*(s1-1)
for r, c in cnt.items():
s2=uf2.size(r)
ans+=-c*(c-1)+(s1-c)*(s2-c)
if fin2[r]:continue
fin2[r]=True
ans+=s2*(s2-1)
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0