POJ 2524 Ubiquitous Religions (并查集)
来源:互联网 发布:汽车修理学习软件 编辑:程序博客网 时间:2024/06/11 04:34
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
#include <cstdio>#include <cstring>#define N 50010int fa[N], deep[N];int n, m, sum;void init(int n){for (int i = 1; i <= n; i++) fa[i] = i, deep[i] = 0;}int find(int x){if (fa[x] == x) return x;return fa[x] = find(fa[x]);}void unite(int x, int y){x = find(x); y = find(y);if (x == y) return;if (deep[x] < deep[y]) fa[x] = y;else{fa[y] = x;if (deep[x] == deep[y]) deep[x]++;}}bool same(int x, int y){return find(x) == find(y);}int main(){int cnt = 0;while (scanf("%d%d", &n, &m), n){cnt++;init(n);for (int i = 1; i <= m; i++){int a, b;scanf("%d%d", &a, &b);unite(a, b);}sum = 0;for (int i = 1; i <= n; i++)if (fa[i] == i) sum++;printf("Case %d: %d\n", cnt, sum);}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 并查集
- jacascript字符串的操作方法
- cpp的json的用法举例
- Android应用开发SharedPreferences存储数据的使用方法
- Codeforces Round #356 (Div. 1)D. Bear and Tower of Cubes【pair使用】
- Hive 没有 not in 解决方案
- POJ 2524 Ubiquitous Religions (并查集)
- BZOJ1711 [Usaco2007 Open]Dining吃饭 题解&代码
- 关于TCS230颜色传感器的使用
- java和python互相调用
- Java用数组实现顺序队列
- redis系列 ---简单介绍
- 第15周程序阅读6
- HDU 3465 线段树
- Android NumberPicker探析