POJ 2524 Ubiquitous Religions (并查集)
2016-06-13 20:06
381 查看
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.
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
Sample Output
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 9 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 10 4 2 3 4 5 4 8 5 8 0 0
Sample Output
Case 1: 1 Case 2: 7
#include <cstdio> #include <cstring> #define N 50010 int fa , deep ; 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; }
相关文章推荐
- django中的request.META字典(部分转载)
- poj2749 Building roads
- Java并发编程-阻塞队列(BlockingQueue)的实现原理
- <OJ_Sicily>Longest Common Subsequence
- JS获取request域的值,JSP页面可以采取以下方式
- iOS UIFont 的学习与使用
- UIWindow
- easyui-combobox添加onChange事件
- A quick CSS layout library
- uefi和legacy bios的深度剖析
- Error:(7, 0) No such property: cruncherEnabled for class: com.android.build.gradle.internal.dsl.Aapt
- 百度富文本ueditor和umeditor遇到的问题和解决办法
- Error querying database
- UIListViewDemo
- NSOprationQueue 与 GCD 的区别与选用
- easyui如何展现被选中的关联数据
- BZOJ_1626_[Usaco2007_Dec]_Building_Roads_修建道路_(Kruskal)
- UITextFile UITextView 键盘回收
- Gradle version 2.10 is required. Current version is 2.8.
- <LeetCode OJ> 357. Count Numbers with Unique Digits