poj 2524 Ubiquitous Religions(并查集)
来源:互联网 发布:石油大学网络教育 编辑:程序博客网 时间:2024/06/14 01:51
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 32572 Accepted: 15798
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
分析:一道并查集的水题。
代码如下:
10 91 21 31 4#include <stdio.h>int pre[50005];int find(int x){int r = pre[x];while(r!=pre[r])r=pre[r];int i=x,j;while(pre[i]!=r){j=i;pre[i]=r;i=pre[j];}return r;}int main(){int n,m;int count=0;int i,j,a,b;while(scanf("%d %d",&n,&m),n||m){for(i=0;i<=n;i++)pre[i]=i;for(i=0;i<m;i++){scanf("%d %d",&a,&b);int fx = find(a),fy = find(b);if(fx!=fy)pre[fx]=fy;}int sum=0;for(i=1;i<=n;i++)if(pre[i]==i)sum++;count++;printf("Case %d: %d\n",count,sum);}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绑定Git@OSC
- java使用groovy中的JsonSlurper来解析json
- iOS启动和关闭状态栏网络请求标志
- 安卓Andriod使用入门(四)【图片毛玻璃效果】
- HP Vertica使用java编写user defined function(UDF)嵌入函数
- poj 2524 Ubiquitous Religions(并查集)
- 解决AndroidStudio添加ProjectLibary后在编译时遇到的各种问题之解决方式索引(finished with non-zero exit value and so on...)
- 使用OKHttp3 get请求 , post请求 , 多文件上传 , 包看包会
- expect之初使用
- kubernetes学习4--资源配额管理(租户配额)
- python编写一个计算小程序-学习笔记8
- 微信小程序开发遇到的问题以及解决
- iOS基础动画教程
- c语言的+