poj1611 - The Suspects
2015-07-24 21:45
309 查看
The Suspects
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.
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.
Output
For each case, output the number of suspects in one line.
Sample Input
Sample Output
题意:一共N个人,N为编号。M组的团体,下面M行团体。每行第一个为人数。团体中的人两两认识,认识可以传递,即A认识B,B认识C,那么A就认识C。问编号为0的人认识几个人(包括他自己)。
题解:并查集求解。
参考代码:
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 26527 | Accepted: 12965 |
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.
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.
Output
For each case, output the number of suspects in one line.
Sample Input
100 4 2 1 2 5 10 13 11 12 14 2 0 1 2 99 2 200 2 1 5 5 1 2 3 4 5 1 0 0 0
Sample Output
4 1 1
题意:一共N个人,N为编号。M组的团体,下面M行团体。每行第一个为人数。团体中的人两两认识,认识可以传递,即A认识B,B认识C,那么A就认识C。问编号为0的人认识几个人(包括他自己)。
题解:并查集求解。
参考代码:
#include<stdio.h> int father[30005],sum[30005]; int f(int n) { return father ==n?n:father =f(father ); } void merge(int x,int y) { int fx,fy; fx=f(x); fy=f(y); if(fx<fy) { father[fy]=fx; sum[fx]+=sum[fy]; } if(fx>fy) { father[fx]=fy; sum[fy]+=sum[fx]; } } int main() { int n,m,k,a,b; while(~scanf("%d%d",&n,&m)) { for(int i=0;i<=n;i++) { father[i]=i; sum[i]=1; } if(n==0&&m==0)break; for(int i=0;i<m;i++) { scanf("%d%d",&k,&a); for(int j=1;j<k;j++) { scanf("%d",&b); merge(a,b); } } printf("%d\n",sum[0]); } return 0; }
相关文章推荐
- .net版本之间的关系
- 黑马程序员--集合框架
- Dom4j使用
- win8、win10下卸载程序报错误2502、2503的解决办法
- Android Api Demos登顶之路(三)
- 拍摄美食教程
- 数据库设计原则(摘抄)
- poj3270--Cow Sorting(置换群)
- js函数在frame中的相互调用详解
- Ognl表达式 值栈对象ValueStack
- PHP 一个可以过滤非法脚本的函数
- 队列训练
- C语言中内联函数的作用 inline
- C++出现Expression : invalid opedrator < 的解决方法
- 疯狂java讲义中的习题,设计一个简单的计算器。
- dd if=/dev/zero of=的含义是什么?Linux 下的dd命令使用详解
- poj 1702 平衡三进制
- dd sKip 和 seek参数理解
- HD 2005 第几天?
- Humble Numbers