POJ 2524 Ubiquitous Religions
来源:互联网 发布:js控制select默认选中 编辑:程序博客网 时间:2024/06/01 16:19
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
#include<cstdio>int fa[50005],rank[50005];int max;void Init(int n){int i;for(i=1;i<=n;i++){fa[i]=i;rank[i]=1;}}int find(int x){int r=x,j,i;while(fa[r]!=r)r=fa[r];i=x;while(i!=r){j=fa[i];fa[i]=r;i=j;}return r;}void merge(int x,int y){int p=find(x),q=find(y);if(q==p)return ;if(rank[p]<rank[q]){fa[p]=q;rank[q]+=rank[p];max--;}else{fa[q]=p;rank[p]+=rank[q];max--;}}int main(){int n,m,i,a,b,j=1;while(scanf("%d%d",&n,&m),n||m){max=n;Init(n);for(i=0;i<m;i++){scanf("%d%d",&a,&b);merge(a,b);}printf("Case %d: %d\n",j,max);j++;}return 0;}
0 0
- 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
- POJ 2524 Ubiquitous Religions
- Git时代的VIM不完全使用教程
- 虚拟现实技术有望成为下一个重要计算平台
- 拆分Oracle分区表的SQL例子
- win7访问共网络共享机器记住或者清除登录密码(问答汇总)
- ntp时间服务器
- POJ 2524 Ubiquitous Religions
- ubuntu下cisco模拟环境dynamips安装与初步使用
- 搜索引擎优化怎样做外链的无效
- Eclipse安装SVN插件
- linux系统关闭防火墙
- MFC下CSocket编程详解( 转载)
- 每日一练------验证完数
- 网站的排名与内容更新的关系
- 如何选择前端核心库