poj 1611 The Suspects(并查集)
来源:互联网 发布:手游源码 完整服务端 编辑:程序博客网 时间:2024/06/06 00:19
The Suspects
Time Limit: 1000MS Memory Limit: 20000K
Total Submissions: 42354 Accepted: 20430
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.
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.
Output
For each case, output the number of suspects in one line.
Sample Input
100 4
2 1 2
5 10 13 11 12 14
2 0 1
2 99 2
200 2
1 5
5 1 2 3 4 5
1 0
0 0
Sample Output
4
1
1
初始状态下是标记为0的那个人得病,当得病的人参加的社团,社团里的人都会得病,求出有多少人得病。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define N 31111int p[N];int fnd( int x ){ return p[x] = p[x] == x ? x : fnd( p[x] ); }void unit( int x, int y ){ int u = fnd( x ); int v = fnd( y ); if( u != v ){ p[u] = y; }}int main(){ //freopen( "in.txt", "r", stdin ); int n, m, k, _stu, stu, num, sum; while( scanf( "%d%d", &n, &m ) != EOF ){ if( n == 0 && m == 0 ) break; for( int i = 0 ; i < n ; i ++ ){ p[i] = i; } for( int i = 0 ; i < m ; i ++ ){ scanf( "%d", &k ); _stu = -1; for( int j = 0 ; j < k ; j ++ ){ scanf( "%d", &stu ); if( _stu != -1 ){ if( fnd( _stu ) != fnd( stu ) ) unit( _stu, stu ); } _stu = stu; } } sum = 0; num = fnd( 0 );//cout<<num<<endl; for( int i = 0 ; i < n ; i ++ ){ //cout<<fnd( i )<<endl; if( fnd( i ) == num ) sum ++; } cout<<sum<<endl; } 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 1611The 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(并查集)
- bootstrap-table解析嵌套json
- SpringBoot配置MyBatis遇到的问题
- java 获取内存dump 的几种方式
- c++中的作用域 四类(函数原型作用域,局部作用域,类作用域,命名空间作用域)
- JS下RSA加解密
- poj 1611 The Suspects(并查集)
- luogu1886 滑动窗口
- 单元测试、集成测试和功能测试
- js window.sidebar下的addpanel 和addfavorite方法
- 倒计时五种方法,方法一:Timer与TimerTask(Java实现)
- tr对标准输入字符替换压缩和删除
- Android TextView部分文字实现点击事件
- C#委托的引用
- 倒计时五种方法,方法二:TimerTask与Handler(不用Timer的改进型)