poj 1161 The Suspects
来源:互联网 发布:hadoop 数据分析 编辑:程序博客网 时间:2024/06/09 19:59
题目链接:点击打开链接
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
ps:裸的并查集
#include <iostream>#include<cstring>using namespace std;int a[30100];int f(int x){ while(x!=a[x]) { x=a[x]; } return x;}int main(){ int n,m; int k; while(cin>>n>>m) { if(n==0&&m==0)break; for(int i=0;i<n;i++) { a[i]=i; } for(int i=0;i<m;i++) { cin>>k; int y,x; for(int j=0;j<k;j++) { cin>>x; if(j==0) { y=x; } else if(f(x)!=f(y)) { a[f(x)]=f(y); } } } int num=0; for(int i=0;i<n;i++) { if(f(0)==f(i))num++; } cout<<num<<endl; } return 0;}
0 0
- poj 1161 The Suspects
- poj 1161 The Suspects
- POJ 1161 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
- 剑指offer - 连续子数组的最大和
- 【惊天真相】ThreadLocal原理与源码分析
- find_if 源码剖析
- python-range用法总结
- java爬虫总是超时
- poj 1161 The Suspects
- Apache Mina(二)
- 剑指offer - 整数中1出现的次数
- HDU 3697--贪心+暴力
- HDU 5793 A Boring Question 打表找规律
- php通过curl进行json数据传输
- JVM介绍
- 世界你好
- Appium移动自动化测试(一)--安装Appium