POJ 2524 Ubiquitous Religions (并查)
来源:互联网 发布:制作统计图的软件 编辑:程序博客网 时间:2024/06/10 01:33
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 22611 Accepted: 11139
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
模板题 没看出是分治来 sad
#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>#include <ctype.h>#include <iostream>#include <algorithm>#include <map>#include <string>#include <vector>using namespace std;int p[50001];int Find(int a){ while(a!=p[a]) a=p[a]; return a;}void build(int x,int y){ x=Find(x); y=Find(y); if(x!=y) p[x]=y;}int main(){ int ll=0; int n,m,x,y; while(cin>>n>>m) { if(n==0&&m==0) break; for(int i=0;i<=n;i++) p[i]=i; while(m--) { cin>>x>>y; build(x,y); } int sum=0; for(int i=1;i<=n;i++) if(p[i]==i) sum++; cout<<"Case "<<++ll<<": "; cout<<sum<<endl; } 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 (并查集)
- Vijos P1493 传纸条 双线程DP
- Dalvik 操作指令
- DataTable排序,去重
- oracle健康检查对企业数据安全的重要性
- 事务原子性
- POJ 2524 Ubiquitous Religions (并查)
- linux查看java jdk安装路径和设置环境变量
- 当你对未来迷茫的时候请看看
- Python -面向对象(一 基本概念)
- ortp库API说明
- MyEclipse中修改默认JSP编辑器的方法.txt
- Java Resource路径小结
- java中的abstract关键字
- 第一条博客从这里开始