PAT A 1118. Birds in Forest

PAT A 1118. Birds in Forest (25)
https://www.patest.cn/contests/pat-a-practise/1118
裸并查集

#include <bits/stdc++.h>
using namespace std;
struct UnionFind
{
    vector<int> id, sz;
    int n, cnt;
    UnionFind(int n) : n(n) {
        id.resize(n);
        sz.resize(n);
        for (int i = 0; i < n; i++) {
            id[i] = i;
            sz[i] = 1;
        }
        cnt = n;
    }
    int fd(int x)
    {
        if (x == id[x]) return x;
        return id[x] = fd(id[x]);
    }
    void unite(int x, int y)
    {
        int fx = fd(x), fy = fd(y);
        if (fx == fy) return;
        if (sz[fx] < sz[fy]) swap(fx, fy);
        id[fy] = fx;
        sz[fx] += sz[fy];
        cnt--;
    }
};
int main()
{
    //freopen("in", "r", stdin);
    int N;
    scanf("%d", &N);
    UnionFind uf(20000);
    set<int> st;
    for (int i = 0; i < N; i++) {
        int K;
        scanf("%d", &K);
        vector<int> B;
        for (int j = 0; j < K; j++) {
            int bi;
            scanf("%d", &bi);
            B.push_back(bi);
            st.insert(bi);
        }
        for (int j = 1; j < K; j++) {
            uf.unite(B[j - 1], B[j]);
        }
    }
    cout << st.size() - (20000 - uf.cnt) << ' ' << st.size() << endl;
    int Q;
    scanf("%d", &Q);
    while (Q--) {
        int u, v;
        scanf("%d%d", &u, &v);
        if (uf.fd(u) == uf.fd(v)) puts("Yes"); else puts("NO");
    }
}