poj 1611 The Suspects
来源:互联网 发布:java ssm权限管理 编辑:程序博客网 时间:2024/05/29 10:02
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 23545 Accepted: 11477
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是携带者,那么和携带者一组的人都是携带者,问有多少个携带者?
解题思路:并查集;
参考代码:
#include <iostream>#include <stdio.h>using namespace std;int father[30000+1],rank[30000+1];void init(int n){for (int i=0;i<=n;i++){father[i]=i;rank[i]=1;}}int find(int x){if (x!=father[x])father[x] = find(father[x]);//路径压缩return father[x];}void Union(int x,int y){int i=find(x);int j=find(y);if (i==j)return;if (rank[i]<rank[j])father[i]=j;else{father[j]=i;if (rank[i]==rank[j])//两棵树同高rank[i]++;}}bool same(int i,int j){if (find(i)==find(j))return true;return false;}int main(){int n,m,k;while (cin>>n>>m){if (n==0&&m==0)break;if (m==0){cout<<1<<endl;continue;}init(n);for (int i=0;i<m;i++){cin>>k;if (k==0)continue;int first,second;cin>>first;if (k==1){Union(first,first);continue;}for (int j=1;j<k;j++){cin>>second;Union(first,second);}}int count=0;for (int i=0;i<n;i++)if (same(i,0)==true)count++;cout<<count<<endl;}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
- apache和php配置
- Android一个TextView设置多种颜色的2种高效方法
- Linux之目录处理命令
- 把WordPress放在根目录而地址显示子目录的方法
- cocos2d-x 3.0 android mk文件 之 自动遍历*.cpp文件
- poj 1611 The Suspects
- T-SQL查询进阶--深入理解子查询
- android 自定义属性
- 忽视碰撞和射线
- linux运维常见问题解决集锦
- centOS安装非编译mysql常见问题
- Mac Adobe CS6 完美破解激活(免替换文件/可更新)详细图文教程
- 【Matlab】text函数使用方法
- iframe 自适应新页面高度