poj 2524 Ubiquitous Religions(并查集)
来源:互联网 发布:php 即时聊天 编辑:程序博客网 时间:2024/06/03 13:57
题目链接:http://poj.org/problem?id=2524点击打开链接
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 35899 Accepted: 17126
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.
#include <iostream>#include <stdio.h>#include <limits.h>#include <stack>#include <algorithm>#include <queue>#include <string.h>using namespace std;int pre[55555];int findx(int x){ int r=x; while(pre[r]!=r) { r=pre[r]; } int i=x;int j; while(pre[i]!=r) { j=pre[i]; pre[i]=r; i=j; } return r;}void join (int x,int y){ int p1=findx(x); int p2=findx(y); if(p1!=p2) { pre[p2]=p1; }}int main(){ int n,k; int cnt=1; while(~scanf("%d%d",&n,&k)&&(n||k)) { memset(pre,0,sizeof(pre)); for(int i=1;i<=n;i++) pre[i]=i; for(int i=0;i<k;i++) { int x,y; scanf("%d%d",&x,&y); join(x,y); } int ans=0; for(int i=1;i<=n;i++) if(pre[i]==i) ans++; cout << "Case " << cnt << ": "; cout << ans <<endl; cnt++; }}
阅读全文
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 并查集
- Altera FPGA程序固化(软件+硬件)
- poj 2104 K-th Number
- 刷门禁——判断卡号是否一样(String==String)出现False
- vue组件内部绑定class还有style样式
- BZOJ3224 普通平衡树
- poj 2524 Ubiquitous Religions(并查集)
- Android音频系统之音频框架 Linux下的音频框架
- Win下操作系统快捷开发环境的搭建补充视频
- 二分搜索(1)
- PKU 2017 信科/软微 夏令营部分机试题解
- fork()请问下面的程序一共输出多少个“-”?
- 设一个没有头结点指针的单链表。一个指针指向此单链表中间的一个结点(不是第一个,也不是最后一个结点),将该结点从单链表中删除,要求时间复杂度O(1)。
- A+B for input-output
- 深入分析JavaWeb Item31 -- JDBC(MySQL)事务管理