poj 1611 并查集
来源:互联网 发布:php抓取访客手机号码 编辑:程序博客网 时间:2024/06/07 11:41
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 32831 Accepted: 15917
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
题意:0 号学生有病,会传染,然后根据相应的组,计算得病的个数
#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;const int maxx=30005;int father[maxx];int sum[maxx];int find_it(int x){ int tempx=x,t; while(tempx!=father[tempx]) tempx=father[tempx]; while(x!=father[x]) { t=father[x]; father[x]=tempx; x=t; } return tempx;}void unite(int num1,int num2){ int tx=find_it(num1); int ty=find_it(num2); if(tx!=ty){ father[tx]=ty; sum[ty]+=sum[tx]; }}int main(){ //freopen("in.txt","r",stdin); int n,m; while(scanf("%d%d",&n,&m)&&(n+m)) { for(int i=0;i<=n;i++){ father[i]=i; sum[i]=1; } for(int i=0;i<m;i++){ int k,a,b; scanf("%d",&k); scanf("%d",&a); for(int j=0;j<k-1;j++){ scanf("%d",&b); unite(a,b); } } printf("%d\n",sum[find_it(0)]); } return 0;}
0 0
- 并查集 POJ 1611
- 【并查集】POJ-1611
- poj 1611(并查集)
- poj 1611 并查集
- poj 1611 并查集
- 【POJ 1611 并查集】
- poj 1611 并查集
- poj 1611(并查集)
- poj-1611 并查集
- POJ 1611 并查集
- poj 1611 并查集
- POJ 1611 (并查集)
- POJ 1611 <并查集>
- poj 1611 并查集
- 并查集 POJ 1611
- POJ 1611 (并查集)
- Poj 并查集
- poj并查集
- Leetcode Word Search
- 欢迎使用CSDN-markdown编辑器
- Oracle11g数据库win8.1系统安装配置图文教程
- c++设计模式之桥接模式
- TTL & OS
- poj 1611 并查集
- 彻底弄懂css中单位px和em,rem的区别
- hdu 5750 数学+预处理
- ArcEngine错误提示
- C语言+EasyX实现数字雨
- UVA11374_Airport Express
- 基于WinForm的Exctract Tool工作总结
- mysql数据库字段操作
- Android Device Administration 设备管理器——实现一键锁屏