POJ-1611 The Suspects
来源:互联网 发布:桌面软件图 编辑:程序博客网 时间:2024/06/07 20:01
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.
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.
For each case, output the number of suspects in one line.
如果一个人被感染,那么整组人都被感染。求被感染的人数。初始时刻,0号被感染。
同组的人放到一个集合里,然后找0号所在的集合。遍历所有的人,如果与0在同一组,就是被感染的。
#include<iostream>#include<vector>using namespace std;struct student {int parent;int rank;};int Find(vector<student>& v, int x) {vector<int> path;while (v[x].parent != x) {path.push_back(x);x = v[x].parent;}for (int i = 0; i != path.size(); i++)v[path[i]].parent = x;return x;}void Union(vector<student>& v, int x, int y) {x = Find(v, x);y = Find(v, y);if (v[x].rank < v[y].rank) {v[x].parent = y;}else {v[y].parent = x;if (v[x].rank == v[y].rank)v[x].rank++;}}int main() {int n, m; cin >> n >> m;while (m != 0 || n != 0) {vector<student> students(n);for (int i = 0; i < n; i++) {students[i].parent = i;students[i].rank = 1;}for (int i = 0; i < m; i++) {int k; cin >> k;if (k == 0) continue;int p; cin >> p;for (int j = 1; j < k; j++) {int s; cin >> s;Union(students, s, p);}}int p = Find(students, 0);int result = 0;for (int i = 0; i < n; i++)if (Find(students, i) == p)result++;cout << result << endl;cin >> n >> m;}}
0 0
- 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
- Hive中UDAF函数的Demo
- java 用验证码的形式验证邮箱
- 窗口根据鼠标移动 tip显示全部信息
- Servlet之forward、sendRedirect、 include区别与使用
- 反射 Module类详解
- POJ-1611 The Suspects
- android 8种对话框(Dialog)使用方法汇总
- Java基础知识题集(2)
- ofo创始人戴威:两年前如何起死回生?
- PLSQL中文显示乱码,真正有效的解决方案(无需修改注册表 )
- MDK编译后生成bin文件占用FLASH大小说明
- 手机端的下拉刷新上拉加载更多功能的实现
- Latex设置表格字体大小
- PCA(主成分分析)、主份重构、特征降维