The Suspects(POJ-1611)
来源:互联网 发布:批发源码 编辑:程序博客网 时间:2024/06/05 05:32
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是传染源,跟他直接接触和间接接触的都是传染源,n个人,m个社团,看看最后有多少个传染源;
思路:最基本的并查集;
ps:读题不认真,看了三遍题,才看到0是最开始的传染源。。。。
思路:最基本的并查集;
ps:读题不认真,看了三遍题,才看到0是最开始的传染源。。。。
#include<iostream>#include<cstdio>using namespace std;int a[30005];int b[505];int sum;int find(int x){ int r=x; while(a[r]!=r) r=a[r]; int i=x,j; while(i!=r){ j=a[i]; a[i]=r; i=j; } return r;}void link(int x,int y){ int fx=find(x),fy=find(y); if(fx!=fy) a[fx]=fy;}int main(){ int m,n,s,x,y; while(cin>>n>>m){ if(n==0&&m==0) break; sum=0; for(int i=0;i<=n;i++){ a[i]=i; } for(int i=0;i<m;i++){ cin>>s>>x; for(int j=1;j<s;j++){ cin>>y; link(x,y); } } int z=find(0); for(int i=0;i<n;i++){ if(find(i)==z) sum++; } cout<<sum<<endl; } return 0;}
阅读全文
0 0
- The Suspects(POJ-1611)
- 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
- eclipse窗口基础认识
- 插入排序的原理
- 2017 计蒜之道 初赛 第一场 A题B题
- Tensorflow升级1.0版本
- centos7 安装 matplotlib和numpy
- The Suspects(POJ-1611)
- gps 简介---之一
- win10配置java环境变量,解决javac不是内部或外部命令等问题
- 图的遍历以及二叉树的遍历
- Find Largest Value in Each Tree Row(找出一棵树每一行的最大值)
- 【HDU1421】搬寝室
- 计蒜客 B kmp基础 kmp模板
- POJ 1273 Drainage Ditches 笔记
- 下个五年