poj2524 并查集
2015-08-09 21:56
363 查看
Ubiquitous Religions
Description
There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your university believe in.
You know that there are n students in your university (0 < n <= 50000). It is infeasible for you to ask every student their religious beliefs. Furthermore, many students are not comfortable expressing their beliefs. One way to avoid these problems is to ask
m (0 <= m <= n(n-1)/2) pairs of students and ask them whether they believe in the same religion (e.g. they may know if they both attend the same church). From this data, you may not know what each person believes in, but you can get an idea of the upper bound
of how many different religions can be possibly represented on campus. You may assume that each student subscribes to at most one religion.
Input
The input consists of a number of cases. Each case starts with a line specifying the integers n and m. The next m lines each consists of two integers i and j, specifying that students i and j believe in the same religion.
The students are numbered 1 to n. The end of input is specified by a line in which n = m = 0.
Output
For each test case, print on a single line the case number (starting with 1) followed by the maximum number of different religions that the students in the university believe in.
Sample Input
Sample Output
Hint
Huge input, scanf is recommended.
Source
Alberta Collegiate Programming Contest 2003.10.18
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 27461 | Accepted: 13478 |
There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your university believe in.
You know that there are n students in your university (0 < n <= 50000). It is infeasible for you to ask every student their religious beliefs. Furthermore, many students are not comfortable expressing their beliefs. One way to avoid these problems is to ask
m (0 <= m <= n(n-1)/2) pairs of students and ask them whether they believe in the same religion (e.g. they may know if they both attend the same church). From this data, you may not know what each person believes in, but you can get an idea of the upper bound
of how many different religions can be possibly represented on campus. You may assume that each student subscribes to at most one religion.
Input
The input consists of a number of cases. Each case starts with a line specifying the integers n and m. The next m lines each consists of two integers i and j, specifying that students i and j believe in the same religion.
The students are numbered 1 to n. The end of input is specified by a line in which n = m = 0.
Output
For each test case, print on a single line the case number (starting with 1) followed by the maximum number of different religions that the students in the university believe in.
Sample Input
10 9 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 10 4 2 3 4 5 4 8 5 8 0 0
Sample Output
Case 1: 1 Case 2: 7
Hint
Huge input, scanf is recommended.
Source
Alberta Collegiate Programming Contest 2003.10.18
#include<iostream> #include<cstring> #include<cstdio> using namespace std; int bin[50001]; int find(int x) { int r=x; while(r!=bin[r]) r=bin[r]; int j=x,i; while(r!=bin[j]) { i=bin[j]; bin[j]=r; j=i; } return r; } int Merge(int x,int y) { int fx=find(x); int fy=find(y); if(fx!=fy) bin[fx]=fy; } int main() { int n,m,num=0; while(~scanf("%d%d",&n,&m)) { num++; if(n==0&&m==0) break; for(int i=1;i<=n;i++) bin[i]=i; for(int i=0;i<m;i++) {int u,v; scanf("%d%d",&u,&v); Merge(u,v); } int count=0; for(int i=1;i<=n;i++) if(bin[i]==i) count++; cout<<"Case "<<num<<": "<<count<<endl; } }
相关文章推荐
- 计蒜客 难题题库 021 最大子阵列
- 0-1背包问题
- ==和equals()的区别
- 开发者,你是如何做到高效开发的
- 动态连接库 DLL 解释
- OpenCV的支持向量机SVM的程序
- java的反射原理与Spring的自动注入(转载)
- Java的垃圾回收机制笔记
- 2015阿里移动推荐算法大赛总结
- 2015华为校园招聘机试题+1道2013年网易校园招聘笔试题
- 回调函数中调用类中的非静态成员变量或非静态成员函数
- N皇后问题
- git学习之旅(六)——github远程服务器
- poj 2586 Y2K Accounting Bug
- 计算机视觉的主页、博客清单
- Java图形化界面
- 计蒜客 难题题库 020 跳跃游戏二
- 依赖注入与控制反转的理解
- java abstract与interface解析
- Python的赋值,浅拷贝与深拷贝