Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate the suspects from others.
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
The input file contains several cases. Each test case begins with two integers n and m in a line, where n is the number of students, and m is the number of groups. You may assume that 0 < n <= 30000 and 0 <= m <= 500. Every student is numbered by a unique integer between 0 and n−1, and initially student 0 is recognized as a suspect in all the cases. This line is followed by m member lists of the groups, one line per group. Each line begins with an integer k by itself representing the number of members in the group. Following the number of members, there are k integers representing the students in this group. All the integers in a line are separated by at least one space.
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
Output
For each case, output the number of suspects in one line.
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
题意:
把学生分成m组,学生0在任何情况下都为患病;只要一组里面有一个学生患病,那么这一组的所有人都为患病,以此类推;让你判断这m组中共有多少同学患病;
思路:
很明了,用并查集,但是有一个点需要注意,0在任何情况下都患病,所以永远都至少有一个同学患病
AC代码
#include <iostream>
#include <cstdio>
using namespace std;
const int maxx=1e6+7;
int pre[maxx],a[maxx];
int find(int x)
{
if(pre[x]==x)
return x;
else
return pre[x]=find(pre[x]);
}
void join(int x,int y)
{
int fx=find(x),fy=find(y);
if(fx!=fy)
pre[fx]=fy;
}
int main()
{
int n,m;
while(scanf("%d%d",&n,&m))
{
for(int i=0;i<n;i++) pre[i]=i;
if(n==0&&m==0) break;
int ans=1;
for(int i=0;i<m;i++)
{
int k;
cin>>k;
cin >>a[0];
for(int j=1;j<k;j++)
{
cin >>a[j];
join(a[0],a[j]);
}
}
for(int i=1;i<n;i++)
{
if(find(0)==find(i)) ans++;
}
cout <<ans<<endl;
}
return 0;
}