poj1611 The Suspects
2015-09-10 20:57
267 查看
http://poj.org/problem?id=1611
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
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
#include <iostream> using namespace std; int pre[50000],a[50000]; int find(int x) { int r=x; while(r!=pre[r]) r=pre[r]; int i=x,j; while(pre[i]!=r) { j=pre[i]; pre[i]=r; i=j; } return r; } void join(int x,int y) { int fx=find(x),fy=find(y); if(fx!=fy) { pre[fy]=fx; } } int main() { int m,n,i; while(cin>>n>>m&&(m||n)) { for(i=0;i<n;i++) pre[i]=i; while(m--) { int num; cin>>num; for(i=0;i<num;i++) cin>>a[i]; for(i=1;i<num;i++) join(a[0],a[i]); } int cnt=0; for(i=0;i<n;i++) { if(find(i)==find(0)) cnt++; } cout<<cnt<<endl; } return 0; }
相关文章推荐
- Android 多渠道打包方案问题记录及解决方案
- 动态规划小结
- MySQL 1040 错误 Too many connections解决方案
- jenkins 通过shell启动java应用程序会随着job完成而被自动关闭的解决方法
- 简单计算器
- Android0824<六>(CheckBox,ListView)
- 彻底搞定二分图的匈牙利算法,最大匹配数(最小覆盖数)、最大独立数、最小路径覆盖
- 教训啊,生成.o文件的代码是绝对不能去调用生成.ko文件的函数变量的
- 0909 随说
- C++_递归排列产生器
- android Json详解
- Qt Creator设置快捷键
- Android0821<五>(TextView、EditText、Button)
- Visual Studio 2015正式版/产品密钥
- 数组、链表、堆栈和队列
- Leetcode:Combinations 组合
- 【LeetCode】160 - Intersection of Two Linked Lists
- 常见Python异常
- 手势识别 ios
- opencv学习笔记-图像对比度、亮度调节