本题就是把所有有关连的点都合并在一棵树中,然后找出0的树根这颗子树的节点数。
AC代码:
#include <stdio.h>
#include <stdlib.h>
#define MAX 30009
int father[MAX],num[MAX];
int a,b,n,m,t,i,j;
void Make_Set(int x){
father[x]=x;
num[x]=1;
}
int Find_Set(int x){
if(x!=father[x]) father[x]=Find_Set(father[x]);
return father[x];
}
void Union(int x,int y){
int xf=Find_Set(x);
int yf=Find_Set(y);
if(xf==yf) return;
if(num[xf]>=num[yf]){
father[yf]=xf;
num[xf]+=num[yf];
}else{
father[xf]=yf;
num[yf]+=num[xf];
}
}
int main(){
while(~scanf("%d %d",&n,&m),(n!=0||m!=0)){
for(i=0;i<n;i++){
Make_Set(i);
}
for(i=0;i<m;i++){
scanf("%d %d",&t,&a);
for(j=1;j<t;j++){
scanf("%d",&b);
Union(a,b);
}
}
a=Find_Set(0);
printf("%d\n",num[a]);
}
return 0;
}