POJ 1611 The Suspects
来源:互联网 发布:zukz2 pro知乎 编辑:程序博客网 时间:2024/06/08 09:08
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 13789 Accepted: 6543
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
思路:用并查集
#include <stdio.h>int num[30003], father[30003];int find(int x);void Union(int x, int y);int main(){int n = 0, m = 0, i = 0, j = 0, k = 0, first = 0, second = 0;while(scanf("%d %d",&n,&m) && (n || m)){for(i = 0; i<n; i++){father[i] = i;num[i] = 1;}for(i = 0; i<m; i++)//对每一组进行合并;{scanf("%d %d", &k, &first);for(j = 1; j<k; j++){scanf("%d", &second);Union(first, second);}}printf("%d\n",num[find(0)]);}return 0;}void Union(int x, int y){int fx = find(x), fy = find(y);if(fx == fy)return ;if(num[fx]<num[fy])//对俩集合进行合并, 把少的集合人数加入到多的中;{num[fy] += num[fx];father[fx] = fy;}else{num[fx] += num[fy];father[fy] = fx;}}int find(int x){if(father[x] != x)//回溯时把所有节点都指向根节点;father[x] = find(father[x]);return father[x];}
- 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
- zoj1730
- shell监控进程是否关闭 (
- 文本翻译API及Web Service
- android 在activity之间传递复杂数据类型
- 快速开发之Myeclipse快捷键
- POJ 1611 The Suspects
- MySQL中文乱码解决方法(原创)
- eclipse 代码编辑时注释快捷管理
- 读退步集的感想
- 1158. Pick numbers
- vc++ 2008 MFC ADO
- Word中分隔符 分页符 分栏符 换行符 分节符的用法
- Java String = "" 和 new String()区别
- Windows Phone 7应用程序开发(二)Hello widnows Phone(4)