Ubiquitous Religions(poj-2524)
来源:互联网 发布:淘宝经营许可证备案 编辑:程序博客网 时间:2024/05/16 15:45
并查集公式:
int pre[51000];
int fin(int x) // 查找
{
int r=x;
while(r!=pre[r])
{
r=pre[r];
}
int i=x,j; //路径压缩
while(pre[i]!=r)
{
j=pre[i];
pre[i]=r;
i=j;
}
return r;
}
void join(int x,int y) 合并
{
int fx=fin(x),fy=fin(y);
if(fx!=fy)
{
pre[fy]=fx;
}
}
题目:
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 10
10 42 34 54 85 8
0 0
Sample Output
Case 1: 1Case 2: 7
#include <cmath>#include <algorithm>#include <cstdio>using namespace std;int pre[51000];int fin(int x){int r = x;while (r != pre[r]){r = pre[r];}int i = x,j;while (pre[i] != r){j = pre[i];pre[i] = r;i = j;}return r;}void join(int x, int y){int fx = fin(x), fy = fin(y);if (fx != fy){pre[fy] = fx;}}int main(){int n, m, i, j;int flag = 1;while (~scanf("%d %d", &n, &m) && !(n == 0 && m == 0)){int num = 0;for (i = 0; i < n; i++){pre[i] = i;}int a, b;for (i = 0; i < m; i++){scanf("%d %d", &a, &b);join(a, b);}for (i = 0; i < n; i++){if (pre[i] == i){num++;}}printf("Case %d: %d\n", flag, num);flag++;}//end--whilereturn 0;}
0 0
- Ubiquitous Religions(poj-2524)
- 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
- CSS3浏览器前缀
- 在VirtualBox上安装Ubuntu问题随笔
- Android Volley框架的使用(四)图片的三级缓存策略(内存LruCache+磁盘DiskLruCache+网络Volley)
- 网教27. 序列极限
- MySQL 基础
- Ubiquitous Religions(poj-2524)
- es6学习(Set和Map)
- Apache日志文件大小管理设置分析方法
- 删除启动选项中的选项
- SVN服务器搭建和使用(一)
- spring 错误 Invalid bound statement (not found) 和 Error creating bean with name 'sqlSessionFactory'
- GVIM 配置 For ubuntu
- SVN服务器搭建和使用(二)
- C++封装、继承、多态