poj 1611 The Suspects
来源:互联网 发布:软件摊销年限 税法 编辑:程序博客网 时间:2024/06/08 18:35
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 17375 Accepted: 8379
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为SARS的传染源,与0在同一集合的都为患者,都能感染与其同一集合的人。
并查集的典型题目
AC代码:
#include <iostream>#include <cstring>using namespace std;int father[30005],rank[30005];int Find_set(int n){ while(n!=father[n]) n=father[n]; return n;}int main(){ int n,m,k,a,b; while(cin>>n>>m) { if(!n&&!m) break; for(int i=0;i<n;i++) { father[i]=i; rank[i]=1; } while(m--) { cin>>k; if(k>=1) cin>>a; for(int i=1;i<k;i++) { cin>>b; int roota=Find_set(a); int rootb=Find_set(b); if(roota!=rootb) { father[rootb]=roota; rank[roota]+=rank[rootb]; } } } cout<<rank[Find_set(0)]<<endl; //注意,这里是Find_set(0),而不是father[0] } 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
- 低版本的虚拟机使用高版本虚拟机创建的系统
- Part3:The High-Scores State
- 安装oraInventory和使用opatch给Oracle打补丁
- [开发工具] 史上最全系列之开发环境搭建之adb
- cookie实现上一次访问时间
- poj 1611 The Suspects
- Innodb的表锁问题_auto_increment
- x264 源码分析 (6)
- 【且听我说“镶嵌数据集建库”】7、影像产品管理流程及典型应用(上)
- 查询数据库中所有表的语句
- 打开和关闭Activity
- socket FTP数据上传
- Java I/O 技术(六)—— 键盘录入 和 转换流
- SQL GROUP BY