The Suspects
来源:互联网 发布:win10添加ubuntu启动项 编辑:程序博客网 时间:2024/05/22 06:19
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<iostream>#include<string.h>#include<stdio.h>#include<ctype.h>#include<algorithm>#include<stack>#include<queue>#include<set>#include<math.h>#include<vector>#include<deque>#include<list>using namespace std;int father[30001]; //存储father indexint group[30001]; //存储当前 集合的人数//查找i的最终fatherint find_set(int i){ int temp = i; while (temp != father[temp]) { temp = father[temp]; } father[i] = temp; return temp;}//合并两个点void join(int x, int y){ int i = find_set(x); int j = find_set(y); if (i != j) { father[i] = father[j]; group[j] += group[i]; //合并时,由于最终father保存当前集合人数 }}int main(){ int n, m, k; while (scanf("%d %d", &n, &m) != EOF&&(n!=0)) { for (int i = 0; i <= 30001; i++)//初始化 { father[i] = i; group[i] = 1; } for (int i = 0; i < m; i++) { scanf("%d",&k); int pre, cur; //前一个 和 当前 for (int j = 0; j < k; j++) { scanf("%d",&cur); if (j) //第一个数不用管 join(pre,cur); pre = cur; } } printf("%d\n", group[find_set(0)]); } return 0;}
0 0
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- android breakpad批量解析dmp的shell脚本
- 程序调试-新手2
- java中对象的初始化与构造器
- 坐标和数字
- 原创
- The Suspects
- 【最长回文】HDU 4513 吉哥系列故事——完美队形II
- 随机字符串算法:13位随机字符串,两两不相同,至少1个大写字母,至少包含这5个字符之3“$@%*#”
- 软件测试模型综述
- 如何理解傅里叶变换
- 蛇形填洞
- 数位DP/数位统计 初探
- centos安装配置fastdfs (1)- 安装篇
- strcpy和strncpy区别