POJ 1611 The Suspects (并查集)

网友投稿 234 2022-08-31

POJ 1611 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 42 1 25 10 13 11 12 142 0 12 99 2200 21 55 1 2 3 4 51 00 0

Sample Output

411

题意

有很多组,同一个组中的学生会经常接触,现在学生0感染了SARS,如果他和其他学生是一组的,那么认为这个组的所有人都受到了感染,问至少有多少人感染了SARS。

思路

并查集,同一个组内的所有学生合并到同一个集合中,最后检测0所在的集合,看有多少人和他属于同一个集合即可。

AC 代码

#include #include#include#include#include#include#includeusing namespace std;const int MAXN = 31000; /*结点数目上线*/int pa[MAXN]; /*p[x]表示x的父节点*/int rank[MAXN]; /*rank[x]是x的高度的一个上界*/void make_set(int x){ /*创建一个单元集*/ pa[x] = x; rank[x] = 0;}int find_set(int x){ /*带路径压缩的查找*/ if(x != pa[x]) pa[x] = find_set(pa[x]); return pa[x];}/*按秩合并x,y所在的集合*/void union_set(int x, int y){ x = find_set(x); y = find_set(y); if(rank[x] > rank[y])/*让rank比较高的作为父结点*/ pa[y] = x; else { pa[x] = y; if(rank[x] == rank[y]) rank[y]++; }}int main(){ int n,m; while(~scanf("%d%d",&n,&m)&&(n||m)) { for(int i=0; i

版权声明:本文内容由网络用户投稿,版权归原作者所有,本站不拥有其著作权,亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容,请联系我们jiasou666@gmail.com 处理,核实后本网站将在24小时内删除侵权内容。

上一篇:互联网营销中“品牌人格化”为何如此重要?(品牌人格化的品牌人格有哪些)
下一篇:HDU 6015 Skip the Class (枚举)
相关文章

 发表评论

暂时没有评论,来抢沙发吧~