POJ 1611The Suspects（并查集）

POJ 1611The Suspects（并查集）

vj链接

Solution

并查集模板题，最后找一遍有多少和 0 点在同一集合即可。

代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<queue>
#include<set>
//#define int long long
using namespace std;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef pair<double, int> pdi;
typedef double dd;
typedef long long ll;
const int MAXN = 30010;
const int MAXM = 3000010;
const dd eps = 1e-6;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;

int n, m, fa[MAXN];
int fd(int x){
    return x == fa[x] ? x : (fa[x] = fd(fa[x]));
}
void un(int x,int y){
    fa[fd(y)] = fa[fd(x)];
}

int main()
{
    while(cin >> n >> m && n)
    {
        for (int i = 0; i < n;i++)
            fa[i] = i;
        while(m--)
        {
            int k;
            cin >> k;
            int x = 0;
            for (int i = 1; i <= k;i++)
            {
                int y;
                cin >> y;
                if(i == 1)
                    x = y;
                else
                    un(x, y);
            }
        }
        int ans = 0;
        for (int i = 0; i < n;i++)
        {
            if(fa[fd(i)] == fa[fd(0)])
                ans++;
        }
        printf("%d\n", ans);
    }
}