POJ 1611 The Suspects
来源:互联网 发布:淘宝塑料米桶 编辑:程序博客网 时间:2024/05/21 09:25
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
简单的并查集:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<limits.h>using namespace std;#define MAXN 30000int pre[MAXN],rank[MAXN];void init(int n){int i;for(i=0;i<n;i++){pre[i]=i;rank[i]=1;}}int find_root(int x){if(x!=pre[x]){pre[x]=find_root(pre[x]);}return pre[x];}void merge(int x,int y){x=find_root(x);y=find_root(y);if(x==y)return;if(rank[x]>=rank[y]){pre[y]=x;rank[x]=rank[x]+rank[y];}else{pre[x]=y;rank[y]=rank[y]+rank[x];}}int main(){int n,m,k;int u,v;int i,j;while(1){cin>>n>>m;if(n==0 && m==0) break;init(n);for(i=0;i<m;i++){cin>>k>>u;for(j=1;j<k;j++){cin>>v;merge(u,v);}}cout<<rank[pre[0]]<<endl;}return 0;}
并查集。。
1 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
- ios 制作自已的framework-2
- hdoj.2044 一只小蜜蜂... 20140726
- 扩展easyui validatebox的两个方法.移除验证和还原验证
- windows 服务安装失败?? 未能加载此程序集或它的某一个依赖项
- ubuntu添加dvd光盘源
- POJ 1611 The Suspects
- Javascript学习笔记之BOM
- Myeclipse快捷键设置
- Android:关于“error opening trace file: Permission denied”问题
- zoj 1204 Additive equations
- 附睾结核很久很久规划局规划局各环节各环节规划就很关键各环节更换
- list-style无效
- 让人吃上安心米,湖南大米之乡
- Ubuntu x64 用 QQ