POJ Ubiquitous Religions (并查集)
来源:互联网 发布:php模拟http 编辑:程序博客网 时间:2024/05/22 00:52
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 25255 Accepted: 12454
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.
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 91 21 31 41 51 61 71 81 91 1010 42 34 54 85 80 0
Sample Output
Case 1: 1Case 2: 7
Hint
Huge input, scanf is recommended.
#include<iostream>#include<stdio.h>using namespace std;#define M 50010int pre[M];int ranks[M];int ans;void init(int n){ for(int i=0;i<n;++i) { pre[i]=i; ranks[i]=1; }}int _find(int x){ if(x==pre[x])return x; return pre[x]=_find(pre[x]);}void _union(int a,int b){ int x= _find(a); int y= _find(b); if(x==y)return ; else { if(ranks[x]<ranks[y]) { ranks[y]+=ranks[x]; pre[x]=y; } else { ranks[x]+=ranks[y]; pre[y]=x; } ans--; }}int main(int argc, char *argv[]){ //freopen("2524.in","r",stdin); int n,m; int a,b; int count=1; while(scanf("%d%d",&n,&m)!=EOF&&n!=0) { init(n); ans = n; while(m--) { scanf("%d%d",&a,&b); _union(a,b); } printf("Case %d: %d\n",count,ans); count++; } return 0;}
0 0
- POJ Ubiquitous Religions (并查集)
- POJ 2524 Ubiquitous Religions(并查集)
- POJ 2524-Ubiquitous Religions 并查集
- POJ 2524 Ubiquitous Religions 并查集
- poj 2524 Ubiquitous Religions(并查集)
- poj 2524 Ubiquitous Religions 并查集
- POJ 2524 Ubiquitous Religions (并查集)
- [poj 2524]Ubiquitous Religions[并查集]
- poj 2524 - Ubiquitous Religions(并查集)
- POJ 2524 Ubiquitous Religions (并查集)
- [并查集]POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions 并查集
- poj 2524 Ubiquitous Religions --- 并查集
- POJ 2524 Ubiquitous Religions(并查集)
- POJ-2524 Ubiquitous Religions 并查集
- poj 2524 Ubiquitous Religions(并查集)
- poj 2524 Ubiquitous Religions(并查集)
- POJ 2524 Ubiquitous Religions (并查集)
- java set get访问器理解
- S5打野攻略
- 将InputStream流装换成String字符串
- Python – __all__ function
- 2015 CVTE校招网测部分试题(技术类)
- POJ Ubiquitous Religions (并查集)
- kafka运行环境优化分析
- CSU 1505: 酷酷的单词(数学啊)
- LeetCode-----Linked List Cycle
- storm 启动异常 Error when processing event
- 指针与多维数组(1)12.6
- poj2139 Six Degrees of Cowvin Bacon(Flyod)
- (SRC)基于稀疏表示的人脸识别
- 导航栏、状态栏设置