POJ 2524 Ubiquitous Religions(并查集)
来源:互联网 发布:东易日盛做效果图软件 编辑:程序博客网 时间:2024/05/18 01:04
链接:http://poj.org/problem?id=2524
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 21949 Accepted: 10770
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
The Submitted Code :
#include <iostream>#include <cstdio>#include <cstdlib>#define MAXN 50005using namespace std;int father[MAXN], N[MAXN], MaxNum;void Make_Set(int n){ for(int i=1; i<=n; i++) { father[i] = i; //使用本身做根;每一个成员开始的父亲节点都为自身; N[i] = 1; }}int Find_Set(int x){ if(x != father[x]) { //合并后树的根是不变的; father[x] = Find_Set(father[x]); } return father[x];}void Union_Set(int x, int y){ x = Find_Set (x); y = Find_Set (y); if(x == y) return ; if(x >= y) { father[y] = x; N[x] += N[y]; MaxNum--; } else { father[x] = y; N[y] += N[x]; MaxNum--; }}int main(){ int n, m, k = 1; while(~scanf("%d %d", &n, &m) && n || m) { Make_Set(n); MaxNum = n; for(int i=0; i<m; i++) { int Md, ME; scanf("%d %d", &Md, &ME); Union_Set(Md, ME); //对属于同一个小组的成员集合进行合并; } printf("Case %d: %d\n", k++, MaxNum); } 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 并查集
- 折腾了一个月算稳定了
- 使用Calendar.getInstance().getTime()取得时间与系统时间相差八小时方法
- web中缓存的使用(.Net)
- nyoj-127-星际之门(一)
- mina在spring中的配置多个端口
- POJ 2524 Ubiquitous Religions(并查集)
- Reorder List
- java 设计模式
- spring+ibatis实现DB的动态切换2(AbstractRoutingDataSource的原理)
- 把每一位上的数 打印出来
- 网络状态2
- Hive 中 Map Join 的适用场景:非等值连接<转>
- Android QQ第三方登录
- 实现自己的pow函数&&打印1到最大的n位数