POJ 1611 The Suspects (并查集)
2016-06-13 20:25
316 查看
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
Sample Output
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 <cstdio> #include <cstring> #define N 30010 int fa , deep , num ; int n, m; void init(int n) { for (int i = 0; i < n; i++) { fa[i] = i; deep[i] = 0; num[i] = 1; } } int find(int x) { if (fa[x] == x) return x; return fa[x] = find(fa[x]); } void unite(int x, int y) { x = find(x); y = find(y); if (x == y) return; if (deep[x] < deep[y]) { fa[x] = y; num[y] += num[x]; } else { fa[y] = x; num[x] += num[y]; if (deep[x] == deep[y]) deep[x]++; } } int main() { while (scanf("%d%d", &n, &m), n) { init(n); for (int i = 1; i <= m; i++) { int k, a, b; scanf("%d%d", &k, &a); for (int i = 2; i <= k; i++) { scanf("%d", &b); unite(a, b); } } printf("%d\n", num[fa[0]]); } return 0; }
相关文章推荐
- MongoDB(三)主从复制以及副本集的配置和使用
- Android下写一个永远不会被KILL掉的进程/服务
- Java数据结构之有效队列
- python学习的一些笔记
- bzoj 3124 直径
- 差分约束系统
- Java自定义异常
- [JS前端开发] js/jquery控制页面动态加载数据 滑动滚动条自动加载事件
- android添加新功能有感
- Android开发之如何保证Service不被杀掉(broadcast+system/app)
- get post 区别
- saiku缓存整理
- saiku缓存整理
- BZOJ 3122 随机数生成器
- 漫长的表白
- LINK : fatal error LNK1104: 无法打开文件“opencv_calib3d249d.lib”问题解决
- 论飞机游戏在C语言程序的基本语句能完成功能的体会
- 导航控制器的使用01
- Android4.3 新特性详解
- ios图片压缩