2013暑假集训第二天下午总结

#define maxn 30005
int father[maxn];
int n,m;

int find(int x )
{
if(x == father[x] ) return x;
father[x] = find(father[x]) ;
return father[x];
}
void unit(int u,int v)
{
father[find(v)] = find(u);
}
void init()
{
for(int i = 0 ; i < maxn ; i ++ )  father[i] = i ;
}
int main()
{
int tn,db;
int x ;
while(scanf("%d%d",&n,&m)!=EOF && !(m == 0 && n == 0))
{
init();
for(int i = 0 ; i < m ; i ++ )
{
scanf("%d",&tn);
if(tn == 0 ) continue ;
tn -- ;
scanf("%d",&db);
for(int j = 0 ; j < tn ; j ++ )
{
scanf("%d",&x);
unit(db,x);
}
}
int tt;
tt = find(0);
int ans ;
ans = 1 ;
for(int i = 1; i < n ;i ++ )
{
if(find(i) == tt)
{
ans ++ ;
}
}
printf("%d\n",ans);
}
return 0;
}