poj1611 The Suspects(并查集)
来源:互联网 发布:免费空间支持域名绑定 编辑:程序博客网 时间:2024/05/22 07:00
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 19981 Accepted: 9700
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<string.h>int pre[30004],num[30004];int find(int a){ while(pre[a]!=a) a=pre[a]; return a;}void uni(int a,int b){ int x=find(a),y=find(b); if(x==y) return; if(num[x]<num[y]) { int r=x; x=y; y=r; } pre[y]=x; num[x]+=num[y];}int main(){ int n,m,i,k,p,q; while(scanf("%d%d",&n,&m),n) { for(i=0; i<n; i++) { pre[i]=i; num[i]=1; } for(int t=0; t<m; t++) { scanf("%d%d",&k,&p); for(i=1; i<k; i++) { scanf("%d",&q); uni(p,q); } } int r=find(0); printf("%d\n",num[r]); } return 0;}
0 0
- poj1611 The Suspects(并查集)
- POJ1611 The Suspects (并查集)
- POj1611:The Suspects(并查集)
- 【POJ1611】The Suspects(并查集)
- poj1611 the suspects(并查集)
- POJ1611 The Suspects(并查集)
- POJ1611 The Suspects 并查集求解
- POJ1611 The Suspects 并查集
- poj1611 The Suspects (并查集)
- poj1611-The Suspects--并查集
- 并查集 poj1611 The Suspects
- POJ1611 The Suspects 并查集
- poj1611 The Suspects(基础并查集)
- poj1611 The Suspects 并查集
- POJ1611:The Suspects【并查集】
- poj1611 The suspects 并查集
- 【并查集】:poj1611,The Suspects
- POJ1611 The Suspects(并查集)
- Bit Map 位图结构
- real210移植记录-支持eMMC,增加菜单操作
- 那些年追过的明星
- Qt下Client与Server之间的双向TCP通信。
- service(1)
- poj1611 The Suspects(并查集)
- c语言 可变数组
- osg模型重写
- 去年12月29日,红旗Linux员工在网上发出请愿书“风雨飘摇,中科红旗路在啊何方?”,又打出横幅”软件所还我核高基专项款,大股东无视职工死活“,到工信部大门口集体请愿、讨薪,闹得很不安宁。
- svn 配置使用 权限配置
- hibernate二级缓存配置
- inux的安装和启动流程(http://www.2cto.com/os/201208/145165.html)
- 安卓系统daemon简单记录
- Flash 摇号器(支持姓名导入)