Poj 2524 Ubiquitous Religions (并查集
来源:互联网 发布:一淘是淘宝的吗 编辑:程序博客网 时间:2024/06/06 14:02
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 33073 Accepted: 16024
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.
并查集模板题,抄抄水过QAQ
并查集模板题,抄抄水过QAQ
#include<stdio.h>int arr[50006];void init(int n){for(int i = 0; i <= n; i++)arr[i] = i; }int find(int x){if(x == arr[x])return x;return find(arr[x]);}void unite(int x,int y){x = find(x);y = find(y);arr[x] = y;}int main(){int m, n, a, b;int j = 0;while(~scanf("%d%d",&m,&n),m+n){init(m);for(int i = 0;i < n; i++){scanf("%d%d",&a,&b);unite(a,b);}int k = 0;for(int i = 1;i <= m; i++){if(i == find(i))k++; }printf("Case %d: %d\n",++j,k);}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 并查集
- POJ3191-The Moronic Cowmpouter
- Java-IO之BufferedInputStream(缓冲输入流)
- nginx配置https双向认证
- 内部类
- javascript 基础 幻灯片图片
- Poj 2524 Ubiquitous Religions (并查集
- [POJ 3168 Treats for the Cows]区间dp
- Git工具的安装和日常使用
- spacevim - 一个模块化的,可扩展的vim配置,支持多种语言开发
- Java泛型的转型
- 深入理解ListView (1)— 一天一点源码
- 设计模式之禅笔记7--代理模式
- window下安装docker
- HDU 2577 How to Type