poj 2524 Ubiquitous Religions
来源:互联网 发布:阿里云助手 编辑:程序博客网 时间:2024/06/03 19:08
Ubiquitous Religions
Time Limit: 5000MS
Memory Limit: 65536K
Total Submissions: 28810
Accepted: 13893
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<stdio.h>#define max 50005int set[max];int find (int p){int t;int child=p;while(p!=set[p])p=set[p];while(child!=p){t=set[child];set[child]=p;child=t;}return p;}void merge(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy)set[fx]=fy;}int main(){ int a,b;int n,m,i;int t=1;while(scanf("%d%d",&n,&m),n||m){ for(i=1;i<=n;i++)set[i]=i;while(m--){scanf("%d%d",&a,&b);merge(a,b);}int k=0;for(i=1;i<=n;i++) { if(set[i]==i) k++; } if(t)printf("Case %d: %d\n",t,k); t++;}}
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
- Java并发编程:深入剖析ThreadLocal
- covs 2800 送外卖
- ACM-ICPC国际大学生程序设计竞赛北京赛区(2015)网络赛H题2015-9-20
- 我辈楷模
- ThinkPHP实战之登录
- poj 2524 Ubiquitous Religions
- 项目19.1 字符及其编码
- 下雨了
- 高清视频软件bandicam的破解方法
- 6.ZigZag Conversion
- XML读写
- 2016蘑菇街笔试——看清问题的本质
- Missing Number
- 转 静态方法,非静态方法