POJ2524 Ubiquitous Religions (并查集)
来源:互联网 发布:it是哪个国家 编辑:程序博客网 时间:2024/05/22 06:47
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.
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<cstdio>#include<cstring>#include<string>#include<algorithm>using namespace std;#define MAXN 50050int s=0;int pre[30030];int find(int x){ int r = x; //用r来传递信息 while(pre[r] != r) //如果r的上级bushir自身 r = pre[r]; //r就接着找上级,直到找到老大 return r; //告诉你x的老大是谁}void join(int x, int y) //x,y成为朋友,于是他们两个的联盟合并了{ int fx = find(x); //找x的老大 int fy = find(y); //找y的老大 if(fx != fy){ pre[fx] = fy; //x的老大成了y老大的小弟 }}int main(){ int n, m, i, j; while(cin >> n >> m&&( n||m)) { s++; int sum = 0; for(j=1; j<=n; j++){ pre[j] = j; } while(m--) { int a, b; cin >> a >> b; join(a, b); } for(j=1; j<=n; j++){ if(pre[j]==j) sum++; } cout << "Case " << s << ": " <<sum << endl; } return 0;}
阅读全文
0 0
- 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 暨并查集入门
- POJ2524 - Ubiquitous Religions (并查集的基础应用)
- poj2524——Ubiquitous Religions(并查集)
- POJ2524——Ubiquitous Religions 并查集基础
- POJ2524 Ubiquitous Religions —— 并查集
- 算法提高 最小方差生成树
- 团体程序设计天梯赛 L1-009. N个数求和
- fork()复制进程
- web新能优化五-图片的预加载
- SQL server 数据库备份恢复 遇挫记
- POJ2524 Ubiquitous Religions (并查集)
- 杭电OJ题目 1000
- Android之理解Activity的启动模式
- CodeForces
- RabbitMQ入门教程(十一):消息属性Properties
- 二级指针个人笔记
- AJAX用户登录后跳转
- python安装MySQL和驱动
- 3515 翻译布尔表达式