POJ
来源:互联网 发布:华为追风软件 编辑:程序博客网 时间:2024/06/05 15:53
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.
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.
Output
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.
Output
For each case, output the number of suspects in one line.
题意:一个人感染,全团队都会感染,一开始0是感染的,问一共有多少人感染
思路:简答的并查集,把每个团队的人连起来就好了,然后扫一遍。
代码:
#include <cstdio>#include <cmath>#include <iostream>#include <cstring>#include <algorithm>#include <queue>#include <stack>#include <vector>#include <map>#include <numeric>#include <set>#include <string>#include <cctype>#include <sstream>#define INF 0x3f3f3f3f#define lson l, m, rt<<1#define rson m+1, r, rt<<1|1using namespace std;typedef long long LL;typedef pair<LL, LL> P;const int maxn = 3e4 + 5;const int mod = 1e8 + 7;int p[maxn];void init(int n) { for (int i = 0; i < n; i++) p[i] = i;}int Find(int x) { return p[x] == x ? x : (p[x] = Find(p[x]));}bool same(int a, int b) { return Find(a) == Find(b);}void unite(int x, int y) { x = Find(x); y = Find(y); if (x != y) p[x] = y;}int n, m;int main() { //freopen ("in.txt", "r", stdin); while (~scanf ("%d%d", &n, &m) && n) { init(n); int num; while (m--) { scanf ("%d", &num); int u, v; scanf ("%d", &u); for (int i = 1; i < num; i++) { scanf ("%d", &v); unite(u, v); } } int ans = 0; for (int i = 1; i < n; i++) { if (same(0, i)) ans++; } printf ("%d\n", ++ans); } return 0;}
阅读全文
0 0
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- vue+element-ui打包时候出现 UglifyJs Unexpected token: punc 问题
- redux-组合函数(compose)理解
- Spring框架入手学习(二)
- 为什么Java中1000==1000为false而100==100为true?
- Android的Input流程分析(好文)
- POJ
- python爬虫----scrapy爬虫之天气预报
- 综合文档下载
- 如何学习linux内核
- [UOJ P219][NOI2016]优秀的拆分[95]
- 动态规划 最长公共子序列LCS
- 无人零售时代来袭,催生零售行业数据分析新工种!
- Mac下载Homebrew
- php