POJ-1611 The Suspects
来源:互联网 发布:雅马哈网络经销商查询 编辑:程序博客网 时间:2024/06/07 12:01
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 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<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int maxm = 30005;int p[maxm], a[maxm];int find(int k);int main(){int n, i, j, k, sum, m, t1, t2;while (scanf("%d%d", &n, &m), n != 0){for (i = 0;i < n;i++)p[i] = i;for (i = 1;i <= m;i++){scanf("%d", &k);if (k == 0)continue;scanf("%d", &a[1]);for (j = 2;j <= k;j++){scanf("%d", &a[j]);t1 = find(a[j - 1]), t2 = find(a[j]);if (t1 != t2) p[t1] = t2;}}int ans = 0, x = find(0);for (i = 0;i < n;i++)if (find(i) == x) ans++;printf("%d\n", ans);}return 0;}int find(int x){if (p[x] == x) return x;return p[x] = find(p[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
- 背包问题
- 图片懒加载
- 最近发现系统rabbitmq丢消息比较严重,于是想了些方案来查找原因,给将消息发送方式添加确认机制。 我们在本地模拟了wms发送打标消息的场景. 1. 有事务 2. 先发点对点队列, 再发订
- HDU 6069 Counting Divisors【区间素筛】【经典题】【好题】
- spring-cloud跨域问题
- POJ-1611 The Suspects
- eclipse中各种图标的含义
- Meaningful naming conventions
- Newtonsoft.Json 使用实例
- 解决Android7.0系统 调用系统相机、系统播放器播放视频、切图兼容问题,报异常android.os.FileUriExposedException
- Java并发编程的艺术(七)——Executors
- mysql零基础入门视频教程免费分享!
- LightOJ
- pinerest界面分析,供抓取