【poj2524】Ubiquitous Religions 【Alberta Collegiate Programming Contest 2003.10.18】
来源:互联网 发布:化工与人工智能 编辑:程序博客网 时间:2024/06/05 11:56
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>#include<iostream>using namespace std;int t,n,m,f[50005],s;int findf(int u){return f[u]=f[u]==u?u:findf(f[u]);}void Union(int u,int v){int x=findf(u),y=findf(v);if(x!=y){f[x]=y;s--;}}void work(){int i,u,v;s=n;for(i=1;i<=n;i++){f[i]=i;}while(m--){scanf("%d%d",&u,&v);Union(u,v);}printf("Case %d: %d\n",t,s);}int main(){scanf("%d%d",&n,&m);while(n||m){t++;work();scanf("%d%d",&n,&m);}return 0;}注:要注意输出格式。
阅读全文
0 0
- 【poj2524】Ubiquitous Religions 【Alberta Collegiate Programming Contest 2003.10.18】
- uva Alberta Collegiate Programming Contest 2011 总结
- 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
- POJ2524--Ubiquitous Religions
- 【POJ2524】Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- 笨办法学 Python · 续 第四部分:进阶项目
- hdoj 1093
- Python匿名函数
- ViewPager+Fragment(二)装修房
- Homebrew不能使用
- 【poj2524】Ubiquitous Religions 【Alberta Collegiate Programming Contest 2003.10.18】
- zstack 串口解读,几家之言汇总。(2)
- .建文件夹
- 数据存储Cookie
- E
- 原生JS获取页面全部的checkbox的方法
- python
- 异步Get解析网络(图片,文字,ListView)
- JavaSE-HttpURLConnection上传文件