poj-1611 The Suspects
来源:互联网 发布:阿里云 虚拟主机 美国 编辑:程序博客网 时间:2024/06/13 20:58
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
题意:SARS病毒易传染,给你一组数据,n为人数,m为m组人,组内成员若有一人患病其他人均会被传染。
并查集思路,所有关系连起来之后查找与0有联系的人。统计个数输出即可。
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#define INF 0x3f3f3f3fusing namespace std;int arr[30100];int find(int r){ return r==arr[r] ? r : arr[r]=find(arr[r]);}void unionn(int x,int y){ int fx=find(x); int fy=find(y); if(fx!=fy) { arr[fx]=fy; }}int main(){ int n,m,t,x,y,i; while (scanf("%d%d",&n,&m),n||m) { for (i=0;i<=n;i++) { arr[i]=i; } for ( i=0;i<m;i++) { scanf("%d",&t); scanf("%d",&x); t --; while (t--) { scanf("%d",&y); unionn(x,y); } } int ans=0; for (i=1;i<=n;i++) { if(find(i)==find(0)) ans ++; } printf("%d\n",ans+1); } 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
- 【笔试】16、输出9*9口诀。
- application
- poj 1679 The Unique MST 【次小生成树模版】
- 数据结构(14)单链表
- HTML笔记
- poj-1611 The Suspects
- C语言-Branch
- HDU 5268 ZYB loves Score——BestCoder Round #44(模拟)
- JDBC应用小案例
- 算法1:k-近邻
- 如何配置android sdk manager进行强制下载
- 数据库
- CSU 1511 残缺的棋盘
- 基于 Android NDK 的学习之旅-----HelloWorld