POJ 1611The Suspects(并查集)
来源:互联网 发布:中国的软件怎么样 编辑:程序博客网 时间:2024/06/10 00:43
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 41098 Accepted: 19838
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 42 1 25 10 13 11 12 142 0 12 99 2200 21 55 1 2 3 4 51 00 0
Sample Output
411
Source
Asia Kaohsiung 2003
题目分析:此题标准并查集模板,依旧是用一个数组来存储集合内元素个数。不过要注意的是及时0号元素没有出现在任何一个社团内,他还是存在的,所以至少有一个嫌疑者。
代码:
/* Author:kzl */ #include<iostream> #include<cstring> #include<algorithm> #include<cstdio> using namespace std; const int maxx = 80000 + 500; int n,m,k,aa,bb; int fa[maxx]; int cun[maxx]; void init(){ for(int i=0;i<maxx;i++)fa[i] = i; for(int i=0;i<maxx;i++)cun[i] = 1; } int find(int x){ int r = x; while(fa[r]!=r)r = fa[r]; while(fa[x]!=x){ int f = fa[x]; fa[x] = r; x = f; } return r; } int main(){ while(scanf("%d%d",&n,&m)!=EOF) { if(m==0&&n==0)break; init(); while(m--){ scanf("%d",&k); if(k!=0)scanf("%d",&aa); int faa = find(aa); for(int i=0;i<k-1;i++){ scanf("%d",&bb); int fbb = find(bb); if(faa!=fbb){ cun[faa]+=cun[fbb]; fa[fbb] = faa; } } } printf("%d\n",cun[find(0)]); } return 0; }
阅读全文
0 0
- POJ 1611 The Suspects(并查集)
- poj 1611 The Suspects 并查集
- POJ 1611 The Suspects 并查集
- poj 1611 The Suspects(并查集)
- POJ 1611 The Suspects 并查集
- POJ--1611--The Suspects【并查集】
- poj 1611-The Suspects:并查集
- POJ--1611 -- The Suspects [并查集]
- poj 1611 - The Suspects(并查集)
- poj 1611The Suspects 并查集
- poj 1611 The Suspects 并查集
- [并查集]POJ 1611 The Suspects
- poj 1611 The Suspects --- 并查集
- POJ 1611 The Suspects (并查集)
- POJ 1611 The Suspects(并查集)
- POJ 1611--The Suspects 并查集
- POJ 1611 The Suspects 并查集
- poj 1611 The Suspects(并查集)
- mysql判断指定数据库是否存在?
- 对Hibernate中关系维护方和级联的理解
- 网络编程释疑之:同步,异步,阻塞,非阻塞
- linux的lsof命令详解
- 1062. 最简分数
- POJ 1611The Suspects(并查集)
- 文章标题
- leetcode--Search in Rotated Sorted Array
- kafka增加SSL认证的Producer客户端代码示例
- Js操作Select大全(取值、设置选中等等)
- NYOJ,XYNUOJ 士兵杀敌(一)
- Office转换PDF技巧:利用虚拟打印机生成pdf文档的使用方法
- 使用nodejs创建http服务器
- Tuxedo FAQs 整理