POJ 1611 The Suspects(并查集算法 路径压缩)
来源:互联网 发布:java 杭州 编辑:程序博客网 时间:2024/06/04 22:02
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 18776 Accepted: 9080
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
题意: 判断有多少个病毒携带者。默认0号为病毒携带者,凡是与0号一起出现的都算病毒携带者。
思路: 并查集算法
import java.io.*;import java.util.*;/* * @author denghuilong * * 2013-8-10上午1:26:31 **/public class Main {public static int student[];public static int ans[];public static void main(String[] args) {Scanner sc=new Scanner(new BufferedInputStream(System.in));while(sc.hasNextInt()){int n=sc.nextInt();int m=sc.nextInt();if(n==0&&m==0)System.exit(0);student=new int[n];ans=new int[n];Arrays.fill(ans,1);for(int i=0;i<n;i++)student[i]=i;for(int i=0;i<m;i++){int k=sc.nextInt();int p=sc.nextInt();for(int j=0;j<k-1;j++){int q=sc.nextInt();union(p,q);}}System.out.println(ans[find(0)]);}}public static void union(int x,int y){int px=find(x);int py=find(y);if(px==py)return;else{if(px>py){student[py]=px;ans[px]+=ans[py];}else{student[px]=py;ans[py]+=ans[px];}}}public static int find(int x){int p=student[x];if(p==x)return p;return find(p);}}
- 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 1611The 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 并查集
- 如何学习一个新方向的知识?
- 8.9号总结
- POJ 2524 Ubiquitous Religions(并查集算法 路径压缩)
- erlang 端口占用
- Linux crontab-自动化的任务
- POJ 1611 The Suspects(并查集算法 路径压缩)
- 检查b3log的环境设置
- 如何向妻子解释设计模式
- java.io.ObjectInputStream$PeekInputStream.readFully(Unknown Source) 可能的问题
- eclipse在线安装fatjar插件,打包jar
- HDU2112
- BCB类模板的设计与实现
- 感兴趣的方向
- 面试复习