POJ 1611 The Suspects 并查集

Problem:
给了一些队伍，求出0号学生所在队伍的人数，每一个学生可以属于多个团队。
Solution:
并查集的模板题，把各个学生merge，然后直接query就可以了。

#include<cstdio>#include<iostream>#include<sstream>#include<cstdlib>#include<cmath>#include<cctype>#include<string>#include<cstring>#include<algorithm>#include<stack>#include<queue>#include<set>#include<map>#include<ctime>#include<vector>#include<fstream>#include<list>using namespace std;#define ms(s) memset(s,0,sizeof(s))typedef unsigned long long ULL;typedef long long LL;const double PI = 3.141592653589;const int INF = 0x3fffffff;int par[30010];void init_par(int n){    for(int i = 0; i <= n; ++i)        par[i] = i;}int getPar(int v){    if(par[v] != v)        par[v] = getPar(par[v]);    return par[v];}int query(int a, int b){    return getPar(a) == getPar(b);}void merges(int a, int b){    par[getPar(a)] = getPar(b);}int main(){//    freopen("D:\\input.txt","r",stdin);//    freopen("/home/really/Document/output","w",stdout);//    ios::sync_with_stdio(false);    int m, n, t, f, num, ans;    while((~scanf("%d%d", &n, &m)) && n){        ans = 1;        init_par(n);        for(int i = 0; i < m; ++i){            scanf("%d",&t);            if(t != 0)                scanf("%d",&f);            for(int j = 1 ; j < t; ++j){                scanf("%d", & num);                merges(f, num);            }        }        for(int i = 1; i < n; ++i){            if(query(0,i))                ans++;        }        printf("%d\n",ans);    }    return 0;}