POJ-1611 The Suspects(并查集)
来源:互联网 发布:网络安全法解读—试卷 编辑:程序博客网 时间:2024/06/15 01:01
The Suspects
Time Limit:1000MS Memory Limit:20000KB 64bit IO Format:%lld & %lluDescription
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
有一个学校,有N个学生,编号为0-N-1,现在0号学生感染了非典,凡是和0在一个社团的人就会感染,并且这些人如果还参加了别的社团,他所在的社团照样全部感染,求感染的人数。
#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include <string> using namespace std; int a[30001],pre[30001]; int find(int x) { if(pre[x]==x) return x; else return pre[x]=find(pre[x]); } void mange(int x, int y) { int fx = find(x), fy = find(y); if (fx != fy) pre[fy] = fx; } int main() { int n,m; while (scanf("%d%d", &n, &m) != EOF && (n || m)) { int sum = 0; for (int i = 0; i < n; i++) pre[i] = i; for (int i = 0; i < m; i++) { int k; scanf("%d", &k); if (k >= 1) { scanf("%d", &a[0]); for (int j = 1; j < k; j++) { scanf("%d", &a[j]); mange(a[0], a[j]); } } } for (int i = 0; i < n; i++) if (find(i) ==pre[0]) sum++; printf("%d\n", sum); } 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(并查集)
- 【C语言】用递归函数是实现函数功能的几个例子
- 图灵测试是不是已经Out了
- javaWeb的三大组件之一Servlet
- css3动画
- 杭电-1272 小希的迷宫 (无向图回路)
- POJ-1611 The Suspects(并查集)
- java 获取当前文件(项目)路径的多种方式
- HDU 5776 sum(水~)
- 设计模式-简单工厂模式
- spfa+枚举 hdu 3768 Shopping
- java字节流实现文件拷贝
- 后台管理系统分类
- Android 让Retrofit与Realm、Parceler一起使用
- 树结构练习——排序二叉树的中序遍历