POJ 1611 求节点0的强连通的节点个数

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define INF 200000

const int MAXN=30005;
int F[MAXN],boy[MAXN];

void init(){
//memset(vis,0,sizeof(vis));
for(int i=0;i<=MAXN;i++){F[i]=i;boy[i]=1;}
}
int GetFather(int x){
return F[x]==x?x:F[x]=GetFather(F[x]);
}
void Union(int a,int b)
{
int t1=GetFather(a);
int t2=GetFather(b);
if(t1!=t2) {F[t1]=t2;boy[t2]+=boy[t1];}
}

int main()
{
int n,m,g;
while(~scanf("%d%d",&n,&m),n){
init();
while(m--){
scanf("%d",&g);
int t1,t2;
scanf("%d",&t1);
for(int i=1;i<g;i++){
scanf("%d",&t2);
Union(t1,t2);
t1=t2;
}
}
printf("%d\n",boy[GetFather(0)]);
}
return 0;
}