[ACM] POJ 2524 Ubiquitous Religions (并查集)
来源:互联网 发布:优化发现环境调研报告 编辑:程序博客网 时间:2024/06/04 06:19
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 23093 Accepted: 11379
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
Hint
Huge input, scanf is recommended.
Source
Alberta Collegiate Programming Contest 2003.10.18
并查集的简单应用。最后分成了多少集合就是结果。
代码:
0 0
- [ACM] POJ 2524 Ubiquitous Religions (并查集)
- [ACM] 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(并查集)
- 关于Session和cookie个人见解
- [ACM] POJ 1611 The Suspects (并查集,输出第i个人所在集合的总人数)
- 巧秒构造造就强大的adapter
- Android Synchronization Fences – An Introduction
- 求助 android nfc 开发
- [ACM] POJ 2524 Ubiquitous Religions (并查集)
- 数据库
- android开发中遇到的问题汇总【八】
- NYOJ--106--背包问题
- HDU 1879--继续畅通工程【kruskal && 最小生成树 && 水题】
- [ACM] hdu 1272 小希的迷宫(并查集)
- 消息机制4
- Linux(cent OS)下软件包管理-ip地址配置和网络yum源/yum命令
- Android之事件传递机制