【POJ】1611 - The Suspects(并查集)
2016-01-13 12:24
513 查看
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
Sample Output
Source
Asia Kaohsiung 2003
并查集的题,需要路径压缩,最后找到0所在树的根,然后找所有根为此的树枝。
代码如下:
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 29202 | Accepted: 14223 |
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
Source
Asia Kaohsiung 2003
并查集的题,需要路径压缩,最后找到0所在树的根,然后找所有根为此的树枝。
代码如下:
#include <stdio.h> int a[30011]; int ta[30011]; int find(int x) { int r=x; while (r!=a[r]) r=a[r]; int j=x; int t; while (a[j]!=r) //路径压缩(此题需要这个步骤,根据代码自己理解理解吧,不需要死记) { t=a[j]; a[j]=r; j=t; } return r; } void join(int x,int y) { int fx,fy; fx=find(x); fy=find(y); if (fx!=fy) a[fx]=fy; } int main() { int n,m; //学生数、团体数 int tn; //每个团体的人数 int t; int ans; int root; while (scanf ("%d %d",&n,&m) && (n||m)) { //首先初始化 for (int i=0;i<n;i++) { a[i]=i; } for (int i=1;i<=m;i++) { scanf ("%d",&tn); for (int j=0;j<tn;j++) { scanf ("%d",&ta[j]); } if (tn>=2) //依次建立树 { for (int j=1;j<tn;j++) { join(ta[j],ta[j-1]); } } } root=find(a[0]); //0的根 ans=0; for (int i=0;i<n;i++) { if (find(a[i])==root) // ans++; } printf ("%d\n",ans); } return 0; }
相关文章推荐
- 无法打开源文件 d3dx9tex.h
- Android-动态注册广播和注销广播
- android启动延迟动画
- 《从Paxos到ZooKeeper》读书笔记--两阶段提交 2PC
- Cocoapod快速使用
- Redis操作命令总结
- iOS 编程中 UI 部分UITableView基础知识
- Linux 分区和目录解析
- Android编程设置TextView颜色setTextColor用法实例
- 目前机器学习最热门的领域有哪些
- C#源代码—猴子第一天摘下若干个桃子,当即吃了一半,还不过瘾就多吃了一个。第二天早上又将剩下的桃子吃了一半,还是不过瘾又多 吃了一个。以后每天都吃前一天剩下的一半再加一个。到第10天刚好剩一个。
- 如何部署Icinga服务端
- python---cookie
- 怎样彻底卸载Virtualbox
- 劳逸结合
- Android开发之style属性和提前定义样式
- android 创建快捷方式
- Java中的static关键字解析
- 点扩散函数point spread function (PSF)
- 推荐几个机器学习算法及应用领域相关的中国大牛