poj 1611 The Suspects
来源:互联网 发布:淘宝刚开店怎么做 编辑:程序博客网 时间:2024/06/05 01:53
The Suspects
Time Limit: 1000MS Memory Limit: 20000K
Total Submissions: 42609 Accepted: 20555
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
基础并查集
#include <algorithm>#include <stdio.h>#include <string.h>#include <cmath>using namespace std;int pre[35000];int findroot(int x){ int r=x; while(pre[r]!=r) { r=pre[r]; } int i = x; while(i != r) { int j; j = pre[i]; pre[i] = r; i = j; } return r;}void mix(int a,int b){ int roota = findroot(a); int rootb = findroot(b); if(roota != rootb) { pre[roota] = rootb; }}int main(){ int n,m; while(scanf("%d%d",&n,&m) && m+n != 0) { for(int i = 0; i < n; i++) { pre[i] = i; } for(int i = 0; i < m; i++) { int nn; int temp; scanf("%d",&nn); scanf("%d",&temp); for(int i = 0; i < nn-1; i++) { int a; scanf("%d",&a); mix(temp,a); } } int ans = findroot(0); int sum = 0; for(int i = 0; i < n; i++) { if(findroot(i) == ans) { sum++; } } printf("%d\n",sum); }}
- 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
- Sybase 系统存储过程
- 数据结构学习笔记吧(11)---基于树的查找
- Spring boot—— Starter详解
- Struts2基本知识
- ROS使用方法摘要(基本命令)
- poj 1611 The Suspects
- 【多线程编程】线程私有数据(TSD)
- python 喷泉码
- RecycleView 的多条目布局
- Nand Flash原理分析与编程
- 高德地图多个Marker标记自动缩放全部显示在屏幕中
- FileZilla
- nodejs之npm详解
- poj算法-使用C语言在VC++6.0实现poj1003