結果

問題 No.1293 2種類の道路
コンテスト
ユーザー ntuda
提出日時 2025-07-15 21:28:38
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 2,880 bytes
コンパイル時間 335 ms
コンパイル使用メモリ 82,588 KB
実行使用メモリ 125,452 KB
最終ジャッジ日時 2025-07-15 21:28:46
合計ジャッジ時間 7,034 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 12 RE * 10
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing


class DSU:
    '''
    Implement (union by size) + (path halving)

    Reference:
    Zvi Galil and Giuseppe F. Italiano,
    Data structures and algorithms for disjoint set union problems
    '''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a: int, b: int) -> int:
        assert 0 <= a < self._n
        assert 0 <= b < self._n

        x = self.leader(a)
        y = self.leader(b)

        if x == y:
            return x

        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x

        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x

        return x

    def same(self, a: int, b: int) -> bool:
        assert 0 <= a < self._n
        assert 0 <= b < self._n

        return self.leader(a) == self.leader(b)

    def leader(self, a: int) -> int:
        assert 0 <= a < self._n

        parent = self.parent_or_size[a]
        while parent >= 0:
            if self.parent_or_size[parent] < 0:
                return parent
            self.parent_or_size[a], a, parent = (
                self.parent_or_size[parent],
                self.parent_or_size[parent],
                self.parent_or_size[self.parent_or_size[parent]]
            )

        return a

    def size(self, a: int) -> int:
        assert 0 <= a < self._n

        return -self.parent_or_size[self.leader(a)]

    def groups(self) -> typing.List[typing.List[int]]:
        leader_buf = [self.leader(i) for i in range(self._n)]

        result: typing.List[typing.List[int]] = [[] for _ in range(self._n)]
        for i in range(self._n):
            result[leader_buf[i]].append(i)

        return list(filter(lambda r: r, result))

N,D,W = map(int,input().split())
dsu1 = DSU(N)
dsu2 = DSU(N)
for _ in range(D):
    a,b = map(int,input().split())
    a -= 1
    b -= 1
    dsu1.merge(a,b)
for _ in range(W):
    c,d = map(int,input().split())
    c -= 1
    d -= 1
    dsu2.merge(c,d)
ans = 0
G1 = dsu1.groups()
G2 = dsu2.groups()
G3 = []
G3all = set()
G4 = []


for G in G1:
    n = len(G)
    if n > 1:
        ans += n * (n-1)
        G3.append(set(G))
for G in G2:
    n = len(G)
    if n > 1:
        ans += n * (n-1)
        G4.append(set(G))

X1 = [-1] * N
X2 = [-1] * N
N1 = len(G3)
N2 = len(G4)
for i,gs in enumerate(G3):
    for g in gs:
        X1[g] = i
for i,gs in enumerate(G4):
    for g in gs:
        X2[g] = i
Y1 = [0] * N1
Y2 = [0] * N2
Y12 = [0] * N2
Y2C = [0] * N2

for i in range(N):
    if X1[i] == -1:
        if X2[i] == -1:
            continue
        else:
            Y2[X2[i]] += 1
    else:
        Y1[X1[i]] += 1
        if X2[i] > -1:
            Y12[X2[i]] += 1
            Y2C[X1[i]] = X2[i]

for i in range(N2):
    ans -= Y12[i] * (Y12[i] - 1)
    ans += (Y1[Y2C[i]] - Y12[i]) * Y2[i]
print(ans)
0