The Suspects
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 26537 | Accepted: 12972 |
Description
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.
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.
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题意:有n个学生(编号[0,n-1])被分成m组,每组可能有交叉的情况,现在SARS正流行,如果一个组中出现可疑者,那么该组所有成员都是可疑者。初始编号0的同学是可疑者,求出所有同学中可疑者的总数。
思路:并查集并记录每个集合的元素总数。每个组内的各个成员union到一起,最后输出有多少人跟0在同一组。
代码:
#include <cstdio>
using namespace std;
#define maxn 30100
int n,m,k;
int fa[maxn];
int sum[maxn];
void init(){
for(int i=0;i<n;i++){
fa[i] = i;
sum[i] = 1;
}
}
int findRoot(int x){
if(x==fa[x]) return x;
return findRoot(fa[x]);
}
void unionSet(int a,int b){
int x = findRoot(a);
int y = findRoot(b);
if(x==y) return;
fa[x] = y;
sum[y] += sum[x];
}
int main(){
int a,b;
while(scanf("%d%d",&n,&m) && n){
init();
while(m--){
scanf("%d",&k);
if(k>=1) {
scanf("%d",&a);
}
for(int i=0;i<k-1;i++){
scanf("%d",&b);
unionSet(a,b);
}
}
printf("%d\n",sum[findRoot(0)]);
}
return 0;
}