poj 1611 The Suspects 【并查集】
来源:互联网 发布:仿麦客网表单源码 编辑:程序博客网 时间:2024/06/03 23:40
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 33382 Accepted: 16196
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
技巧:用rank[ ]记录每个节点所在集合的个数,
代码:
#include<cstdio>#include<algorithm>using namespace std;int per[30000+10],rank[30000+10];//记录每个根节点所在的集合的个个数 int find(int x){if(x==per[x])return x;else{return per[x]=find(per[x]);} }void merge(int x,int y){int fx=find(x);int fy=find(y);if(fx==fy) return;if(rank[fx]<rank[fy]){per[fx]=fy;rank[fy]+=rank[fx]; }else{per[fy]=fx;rank[fx]+=rank[fy];} } int main() { int n,m; int k,a[30000+10]; while(scanf("%d%d",&n,&m)&&(n||m)) { for(int i=0;i<n;i++) { per[i]=i; rank[i]=1; } for(int i=0;i<m;i++) { scanf("%d",&k); for(int i=0;i<k;i++) { scanf("%d",&a[i]); } for(int i=1;i<k;i++) merge(a[i-1],a[i]); }printf("%d\n",rank[find(0)]);//0所在集合也是其父节点所在集合 } 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(并查集)
- HDU 1536 S-Nim(SG经典博弈)
- Keepalived+Nginx实现高可用(HA)
- php正则表达式
- 函数传参
- HTML5的FileReader用法
- poj 1611 The Suspects 【并查集】
- 进程之写时拷贝技术
- APP开发实战127-APP性能优化工具
- SDUT 2127 树-堆结构练习——合并果子之哈夫曼树
- mysql基本sql语句大全(基础用语篇)
- action里result到action之间的跳转、不同包package
- 并发服务器设计
- Windows平台一下内存泄漏小工具的开发
- centos7 安装lamp环境