提出 #28347336

---

ソースコード 拡げる

from collections import Counter
import sys
input = sys.stdin.readline

N, K, L = map(int, input().split())


class UnionFind:
    def __init__(self, N):
        self.par = [-1] * (N + 1)

    def find(self, x):
        if self.par[x] < 0:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return False
        if x > y:
            x, y = y, x

        self.par[x] += self.par[y]
        self.par[y] = x
        return True

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        p = self.find(x)
        return [i for i in range(1, N + 1) if self.find(i) == p]

    def size(self, x):
        return -self.par[self.find(x)]


uf1 = UnionFind(N)
uf2 = UnionFind(N)
for _ in range(K):
    p, q = map(int, input().split())
    uf1.unite(p, q)

ans = [1 for _ in range(N + 1)]
for _ in range(L):
    r, s = map(int, input().split())
    uf2.unite(r, s)

pars = [(uf1.find(i), uf2.find(i)) for i in range(1, N + 1)]
C = Counter(pars)
print(*[C[p] for p in pars])

提出情報

ジャッジ結果