POJ 1611 The Suspects (并查集)
来源:互联网 发布:linux中touch命令 编辑:程序博客网 时间:2024/06/05 07:12
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 23426 Accepted: 11400
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
#include<iostream>int pre[30010];int ranks[30010];using namespace std;void init(int n){ for(int i=0;i<n;++i) { pre[i]=i; ranks[i]=1; }}int _find(int x){ if(pre[x]==x)return x; return pre[x]=_find(pre[x]);}void _union(int a,int b){ int p=_find(a); int q=_find(b); if(p==q) return ; if(ranks[q]<=ranks[p]) { pre[q]=p; ranks[p]+=ranks[q]; } else { pre[p]=q; ranks[q]+=ranks[p]; }}int main(int argc, char *argv[]){ int n,m; int k; int t; int x,y; while(scanf("%d%d",&n,&m)!=EOF) { if(n==0&&m==0)return 0; init(n); while(m--){ scanf("%d",&k); scanf("%d",&x); for(int j=1;j<k;++j) { scanf("%d",&y); _union(x, y); } } int x=_find(0); printf("%d\n",ranks[x]); } 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性能优化之几个实际优化示例
- 2014-12-2 bec复习打卡
- POJ 1611 The Suspects (并查集)
- 说明指针作为函数参数(二)
- 大数据系列教程_Linux系统配置
- eclipse4下面安装ADT成功后,但没有ADT的那个图标显示的解决方法
- C常见笔试题(二)
- 【笔记】Java编程思想—一多态
- JMeter 压测报告
- nodejs环境设置
- eclipse Maven配置