poj 1611 The Suspects
来源:互联网 发布:e4a数据库 编辑:程序博客网 时间:2024/06/06 12:55
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 22763 Accepted: 11060
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
题目大意:
有一个学校,有N个学生,编号为0-N-1,现在0号学生感染了非典,凡是和0在一个社团的人就会感染,并且这些人如果还参加了别的社团,他所在的社团照样全部感染,求感染的人数
#include <iostream>#include <stdio.h>using namespace std;const int MaxSize=30005;int father[MaxSize];int num[MaxSize];int size[MaxSize];int Find(int x){ while (x!=father[x]) { x=father[x]; } return x;}void Union(int x,int y){ int fx,fy; fx=Find(x); fy=Find(y); if(size[fx]>size[fy]) { father[fy]=father[fx]; size[fy]+=size[fx]; } else { father[fx]=father[fy]; size[fx]+=size[fy]; }}int main(){ int N,M; int ans=0; while (scanf("%d%d",&N,&M)!=EOF && (N||M)) { for (int i=0; i<N; i++) { father[i]=i; size[i]=1; } for (int i=0; i<M; i++) { scanf("%d",&ans); for (int k=0; k<ans; k++) { scanf("%d",&num[k]); } for (int k=1; k<ans; k++) { Union(num[k-1],num[k]); } } ans=1; for (int i=1; i<N; i++) { if(Find(i)==Find(0)) { ans++; } } printf("%d\n",ans); } 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 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
- 外部表初始学习
- 格雷的疑惑
- Fatal error: Call to undefined function imagettftext()
- WWDC 2012 Session笔记——200 What is new in Cocoa Touch
- Undo Internal<2>
- poj 1611 The Suspects
- WiFi信号强度--SIGNAL_POLL
- Eclipse配置Maven插件
- HDOJ 2553 皇后问题(1、回溯法 2、位运算)
- Hadoop MapReduce编程入门案例
- IOS学习笔记-3
- 【SAE 部署 JavaWeb 项目报 404 错误】
- Spring Mvc全局异常捕获
- GDB实践:一场std::sort引发的coredump