poj 2524 Ubiquitous Religions
来源:互联网 发布:淘宝静物拍摄灯光布置 编辑:程序博客网 时间:2024/06/05 05:51
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<iostream>#include<cstdlib>#include<string>#include<algorithm>#include<cstdio>#include<cmath>#include<cstring>#include<stack>#include<queue>#include<iomanip>#include<map>#define pi 3.14159265358979323846using namespace std;int pre[50005];int ans;int find(int x){ if(x!=pre[x]) pre[x]=find(pre[x]); return pre[x];}void unions(int x,int y){ int a,b; a=find(x); b=find(y); if(a!=b) { pre[a]=b; --ans; }}int main(){ int n,m; int cnt=0; while(scanf("%d %d",&n,&m)!=EOF&&(n||m)) { for(int i=1;i<=n;++i) pre[i]=i; int a,b; ans=n; for(int i=0;i<m;++i) { scanf("%d %d",&a,&b); unions(a,b); } printf("Case %d: %d\n",++cnt,ans); } 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
- linux下svn常用指令
- 8VC Venture Cup 2016 -C - Block Towers-二分
- 分类器评价、混淆矩阵与ROC曲线
- HTTP协议
- hibernate配置文件hibernate.cfg.xml安全线程的session配置
- poj 2524 Ubiquitous Religions
- Struts2基本原理
- iOS常见问题解决大全(持续更新)
- 修行的开始
- long型转化成BigDecimal
- eclipse 中 *.properties 中 unicode 显示 中文(国际化),需要安装Properties Editor
- 一个优化极点的ViewHolder
- LeetCode Missing Number(一次通过)
- tomcat参数配置