poj 1611 The Suspects(简单并查集)
来源:互联网 发布:linux dhcp server 编辑:程序博客网 时间:2024/05/22 05:23
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 33351 Accepted: 16175
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
4
11#include<cstdio>#include<iostream>using namespace std;int pre[30010];int find(int x){ if(pre[x] != x) pre[x] = find(pre[x]); return pre[x];}void Union(int x,int y){ int fx = find(x); int fy = find(y); if(fx == fy) return; if(fx < fy) pre[fy] = fx; else pre[fx] = fy;}int main(){ int n , m , k , a , b , i; while(cin >> n >> m,n + m) { for(i = 0 ; i < n ; i++) pre[i] = i; while(m--) { cin >> k >> a; for(i = 1 ; i < k ; i++) { cin >> b; Union(a,b); } } int ans = 1 ; for(i = 1 ; i < n ; i++) if(find(i) == find(0)) ans++; cout << ans << endl; } return 0;}
0 0
- POJ 1611The Suspects(简单并查集)
- POJ-1611-The Suspects (简单并查集!)
- POJ - 1611 The Suspects(简单并查集)
- POJ 1611 The Suspects(并查集,简单)
- poj 1611 The Suspects(简单并查集)
- POJ 1611 The Suspects(简单并查集)
- zoj 1789||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:并查集
- sass学习笔记
- 【Git/Github学习笔记】Git分支管理(一)
- sql分页查询
- android 长图显示模糊问题
- 更改UIAlertAction的字体颜色
- poj 1611 The Suspects(简单并查集)
- 进程调度算法 短作业优先 SJF
- SpringMVC后台程序接收ajax异步提交数据的实例
- Wifi的初步使用
- 装饰模式——为RecyclerView添加头与脚
- 110.Which task would you perform before you run Oracle Universal Installer (OUI) in silent or suppre
- java servlet 错误解决 HTTP Status 405 - HTTP method GET is not supported by this URL type
- css3利用transform实现简单的旋转效果
- jQuery实现一个表格的简单上下翻页