【POJ】1611 The Suspects
来源:互联网 发布:d3.js demo 编辑:程序博客网 时间:2024/05/22 06:56
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 23286 Accepted: 11313
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
Source
Asia Kaohsiung 2003
数据读入略坑,并查集基础应用。
CODE:
#include <cstdio>#include <cstring>#include <iostream> #define MAXN 100000 int father[MAXN],rank[MAXN]; void makeset(int n) { for (int i = 0; i < n; i++) { father[i] = i; rank[i] = 1; }} int findset(int x) { return father[x] != x ? father[x] = findset(father[x]) : x;} void unionset(int x, int y) { int a = findset(x); int b = findset(y); if(a == b) return; if(rank[a] >= rank[b]){ father[b] = a; rank[a] += rank[b]; }else { father[a] = b; rank[b] += rank[a]; }} int main(){ int n,m,k,first,next,i,j; while(scanf("%d%d", &n, &m) == 2 ) { makeset(n); for(i=0;i<m;i++) { scanf("%d", &k); if(k==0) continue; scanf("%d", &first); for(j=1;j<k;j++) { scanf("%d", &next); unionset(first,next); } } if(n==0&&m==0) return 0; printf("%d\n", rank[father[0]]); } return 0;}
0 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 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
- 时间对话框的使用和日期对话框的使用
- [leetcode]Word Search
- 状态栏编程(显示系统时间和进度条)
- hdu 4135 容斥原理
- python监控日志并予以清理
- 【POJ】1611 The Suspects
- iOS 图形编程总结
- InputFormat的数据划分、Split调度、数据读取三个问题的浅析
- easyui 获得属性值
- 第五届蓝桥杯软件类省赛真题 Java本科A 斐波那契
- LeetCode Binary Tree Level Order Traversal II
- 汉诺塔
- SCI论文通讯作者需具备的条件
- Higher 'direct path read' Waits in 11g when Compared to 10g (Doc ID 793845.1)