poj 1611 The Suspects
来源:互联网 发布:毛笔字软件下载 编辑:程序博客网 时间:2024/06/05 03:38
The Suspects
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 40000/20000K (Java/Other)
Total Submission(s) : 30 Accepted Submission(s) : 16
Problem 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 n1, 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代码:#include<stdio.h>int num[30010];int find(int x){int r=x;while(num[r]!=r)r=num[r];return r;}void merge(int x,int y){int x1,y1;x1=find(x);y1=find(y);if(x1!=y1)num[y1]=x1;}int main(){int n,m,k,a1,a,i,j,sum;while(scanf("%d %d",&n,&m) , (n || m)){for(i=0;i<n;i++){num[i]=i;}for(i=0;i<m;i++){scanf("%d",&k);if(k>=1)scanf("%d",&a1);for(j=1;j<k;j++){scanf("%d",&a);merge(a1,a);}}sum=0;for(i=1;i<n;i++){if(find(i)==find(0))sum++; } printf("%d\n",sum+1);} return 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 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
- ivision (DP_斜率优化|四边形不等式优化)
- Firemonkey的旁门左道[三]
- 图解HTTPS
- Hdu 2888 Check Corners (数据结构_二维RMQ)
- Lucene 对搜索关键字进行高亮显示
- poj 1611 The Suspects
- DP_状态压缩DP
- 珍惜时间
- uva第一道题 11636 Hello World
- 在指定目录下找ftl模板
- 课程助理 For Android 预览版
- 【DFS】hdu 2181 哈密顿绕行世界问题
- Java判断一个日期时间是否是昨天
- UVA 704 Colour Hash (双向bfs + 判重)