The Suspects
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 Source |
说点题外话啊,这题我去年第一次学并查集的时候好像刷过一遍。结果现在根本记不起来这些做法= =
我去年刷那么多题好像除了终于理解了并查集的基本原理之外没有什么卵……不,没有什么用啊……自学果然超级困难啊。不过学会了之后又好有成就感……
题意:0号生病了。现在和0号一组的人以及和0号一组的人组过队的人都有可能生这个病。问:一共有多少人可能生病?(带上0号)
题解:主要是要学一下并查集过程中间合并那些数,一开始每个都只有一个,每次合并集合顺便也把集合里数的个数合并。最后查找0号所在的根节点的集合的值!
#include<stdio.h>
#include<string.h>
int per[30000+10],ans[30000+10];
int Find(int x)
{
while(x!=per[x])
x=per[x];
return x;
}
void Merge(int x,int y)
{
int fx=Find(x);
int fy=Find(y);
if(fx!=fy)
{
per[fy]=fx;
ans[fx]+=ans[fy];
}
}
int main()
{
int i,k,a,b,n,m;
while(scanf("%d%d",&n,&m),n||m)
{
for(i=0;i<n;i++)
{
per[i]=i;
ans[i]=1;
}
while(m--)
{
scanf("%d",&k);
scanf("%d",&a);
for(i=1;i<k;i++)
{
scanf("%d",&b);
Merge(a,b);
}
}
printf("%d\n",ans[Find(0)]);
}
return 0;
}