Problem 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.
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
题解
求0所在的集合总共有多少个节点
难点
要对并查集的init函数、find函数和Union函数进行改造,合并时按节点数大的合并节点数小的
#include<iostream> #include<cstring> using namespace std; const int MAXN=30010; int f[MAXN];//与一般并查集不同的是,按节点数合并的并查集父节点存的是该集合节点数的相反数 //其余叶节点各自存各自的父节点 void init(){ memset(f,-1,sizeof(f));//初始化-1,表示初始每个点都是一个集合,节点数为1 } int find(int x){ if(f[x]<0) return x; f[x]=find(f[x]); return f[x]; } void Union(int x,int y){ int fx=find(x),fy=find(y); if(fx!=fy){ if(f[fx]<f[fy]){ f[fx]+=f[fy]; f[fy]=fx; } else{ f[fy]+=f[fx]; f[fx]=fy; } } } int main(){ int n,m; while(cin>>n>>m&&(n||m)){ int k,a,b; init(); while(m--){ cin>>k; for(int i=0;i<k;i++){ cin>>b; if(i==0) a=b; else Union(a,b); } } cout<<-f[find(0)]<<endl; } return 0; }