poj Ubiquitous Religions
来源:互联网 发布:淘宝外卖商家入驻 编辑:程序博客网 时间:2024/05/22 10:41
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 25579 Accepted: 12637
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.
并查集水题
<pre name="code" class="cpp">#include <stdio.h>#include <string.h>int pos[51000] ;int find(int x){int r = x ;while(pos[r] != r){r = pos[r] ;}int temp ;while(x != pos[x]){temp = pos[x];pos[x]=r;x = temp ;}return r ;}void join(int x,int y){int fx = find(x) ;int fy = find(y) ;if(fx != fy){pos[fx] = fy ;}}int main(){int n,m,cases=1;while(scanf("%d%d",&n,&m) != EOF && (m||n)){memset(pos,0,sizeof(pos)) ;for(int i = 0 ; i < m ; ++i){int x, y;scanf("%d%d",&x,&y) ;if(pos[x] == 0){pos[x] = x;}if(pos[y] == 0){pos[y] = y ;}join(x,y) ;}int sum = 0 ;for(int i = 1 ; i <= n ; ++i){if(pos[i] == i){++sum ; }if(pos[i] == 0){++sum ;}}printf("Case %d: %d\n",cases++,sum) ;}return 0 ;}
0 0
- POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- poj 2504 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
- 三大框架的理解
- powerpc 汇编编程参考
- 行记录转换为列记录
- 导出、导入模块:《三 -- 针对【指定时间段内创建、修改的模块】》
- [源码下载]Demo1 客户端从服务器获取信息(基于networkcomms2.3.1)
- poj Ubiquitous Religions
- Jquery中的serialize()
- BroadcastReceiver广播接收者
- 求知若饥,虚心若愚
- 告诉你数字签名是什么
- 【html5、百度地图、SpringMVC】
- 用AutoLayout对UIScrollView进行布局做的引导页
- Problem 031 ——UVa 156 - Ananagrams
- Hive自定义UDTF