POJ2524——Ubiquitous Religions
来源:互联网 发布:异次元战姬攻略知乎 编辑:程序博客网 时间:2024/05/28 15:45
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.
Source
Alberta Collegiate Programming Contest 2003.10.18
裸的并查集,用来当模板了
裸的并查集,用来当模板了
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int father[50010];int cnt;int find(int x){if(father[x]==-1)return x;return father[x]=find(father[x]);}void init(){memset(father,-1,sizeof(father));}void merge(int x,int y){int a=find(x);int b=find(y);if(a!=b){father[a]=b;cnt--;}}int main(){int n,m;int icase=1;while(~scanf("%d%d",&n,&m)){if(!n && !m)break;init();cnt=n;int a,b;for(int i=1;i<=m;i++){scanf("%d%d",&a,&b);merge(a,b);}printf("Case %d: %d\n",icase++,cnt);}return 0;}
0 0
- POJ2524——Ubiquitous Religions
- POJ2524——Ubiquitous Religions(并查集)
- poj2524——Ubiquitous Religions(并查集)
- POJ2524——Ubiquitous Religions 并查集基础
- POJ2524 Ubiquitous Religions —— 并查集
- poj2524 Ubiquitous Religions
- Ubiquitous Religions POJ2524
- POJ2524 Ubiquitous Religions
- POJ2524:Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524--Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- POJ2524,Ubiquitous Religions
- poj2524--Ubiquitous Religions
- 分享一个监控MFS的nagios插件
- elipse的反编译jad配置
- hive基础
- android 写文件权限
- Attribute在.net编程中的应用(一)
- POJ2524——Ubiquitous Religions
- 环融科技“市场增速放缓背景下的营销战略与创新”
- 用两个栈实现队列[数据结构]
- pig基础
- 如何手动删除一个Windows服务
- 如何手动添加一个Windows服务
- Android存储访问及目录
- HBASE基础
- 如何更新当前记录的某个字段等于本记录的某个字段+上一条记录的某字段之和