In the Not-Spreading-Your-Sickness University (NSYSU), there are many student groups. Students in the same group intercommunicate with each other frequently, and a student may join several groups. To prevent the possible transmissions of SARS, the NSYSU collects the member lists of all student groups, and makes the following rule in their standard operation procedure (SOP).
Once a member in a group is a suspect, all members in the group are suspects.
However, they find that it is not easy to identify all the suspects when a student is recognized as a suspect. Your job is to write a program which finds all the suspects.
Input
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
Output
Sample Input
100 4 2 1 2 5 10 13 11 12 14 2 0 1 2 99 2 200 2 1 5 5 1 2 3 4 5 1 0 0 0
Sample Output
4 1 1
题意:0是感染者,与0在一起的就是被感染了,求被感染人数。
100个学生,4组 第一组2个人 后面是编号
#include <stdio.h>
int rankk[30001];
int F[30001];
int findd(int n)
{
int root=n;
int temp=n;
while(root!=F[root])
root=F[root];
while(temp!=root)//路径压缩
{
int t=F[temp];
F[temp]=root;
temp=t;
}
return root;
}
void unionn(int x,int y)
{
int root1,root2;
root1=findd(x);
root2=findd(y);
if(root1!=root2)
F[root1]=root2;
}
int main()
{
int n,m,i,x,y,t,s[30001],c;
while(1)
{
int sum=0;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
F[i]=i;
if(n==0&&m==0)
break;
while(m--)
{
scanf("%d",&t);
for(i=0;i<t;i++)
scanf("%d",&s[i]);
for(i=0;i<t-1;i++)
unionn(s[i],s[i+1]);
}
for(i=0;i<n;i++)
if(findd(i)==findd(0))//有相同的祖先
sum++;
printf("%d\n",sum);
}
return 0;
}