POJ1611(并查集)
来源:互联网 发布:ubuntu可以用来做什么 编辑:程序博客网 时间:2024/06/08 03:15
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 <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 30005;int par[maxn];int s[maxn];int n, m;void init(){ for (int i = 0; i < n; i++) par[i] = i;}int find_(int x){ if (par[x] == x) return x; return par[x] = find_(par[x]);}void unite(int x, int y){ int fx = find_(x); int fy = find_(y); if (fx == fy) return; else if (fx < fy) par[fy] = fx; else par[fx] = fy;}int main(){ //freopen("F:\\test.txt", "r", stdin); while (scanf("%d%d", &n, &m)) { if (n == 0 && m == 0) break; init(); for (int i = 0; i < m; i++) { int k; scanf("%d", &k); memset(s, 0, sizeof(s)); for (int j = 0; j < k; j++) scanf("%d", &s[j]); for (int j = 1; j < k; j++) unite(s[j - 1], s[j]); } int ans = 0; for (int i = 0; i < n; i++) { if (find_(i) == find_(0)) ans++; } printf("%d\n", ans); } return 0;}
0 0
- POJ1611 并查集
- poj1611并查集
- POJ1611(并查集)
- poj1611 并查集
- POJ1611(并查集)
- poj1611(并查集)
- 并查集POJ1611
- poj1611并查集
- poj1611 并查集
- poj1611(并查集)
- POJ1611(并查集)
- POJ1611->并查集
- POJ1611-----并查集
- poj1611-并查集
- 并查集:poj1611
- 1poj1611(并查集)
- poj1611(简单并查集)
- poj1611 简单并查集
- NOJ1560---Let Slimes Grow Up(线段树)
- 求周期(周期内无相同数字)
- QT 打开文件对话框总结
- 看数据结构写代码(50)伙伴系统
- 查找api函数地址
- POJ1611(并查集)
- HDU4114 Disney's FastPass(floyd+状态压缩DP)旅游问题升级(难)
- Step into MongoDB - 03 - Database & Collection & Document
- 基金都快放假吗,可感受到
- bzoj 3993: [Sdoi2015]星际战争
- 图片随机显示器(C#)
- openstack学习笔记----KVM
- nodejs笔记
- JSP Xxx cannot be resolved to a type