并查集连通块计数

def solve(____):
    n = int(____)
    parent = list(range(____))
    def find(____):
        if parent[x] != x:
            parent[x] = find(____)
        return parent[x]
    for e in edges.split(____):
        a, b = map(int, e.split(____))
        pa, pb = find(____), find(____)
        parent[pa] = pb
    components = len(set(find(____) for i in range(____, n + ____)))
    print(____)