POJ 2524-Ubiquitous Religions(并查集)
来源:互联网 发布:flv播放器 mac 编辑:程序博客网 时间:2024/06/18 07:06
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 25383 Accepted: 12530
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.
题意:输入n,m代表有n个帮派,下面输入m行x,y,代表学生x,y同一个帮派,问总共有多少个帮派。
思路:典型的并查集。求出每个的集合,数数这些集合的个数即可
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <algorithm>#include <iostream>using namespace std;int uset[100010];int rank[100010];void makeset(int n){ memset(uset,0,sizeof(uset)); for(int i=1;i<=n;i++) uset[i]=i;}int find(int x){ if(uset[x]!=x) uset[x]=find(uset[x]); return uset[x];}void unionset(int x,int y){ if((x=find(x))==(y=find(y))) return; if(rank[x]>rank[y]) uset[y]=x; else { uset[x]=y; if(rank[x]==rank[y]) rank[y]++; }}int main(){ int n,m,i; int a,b; int t=1; while(~scanf("%d %d",&n,&m)) { if(n==0&&m==0) break; makeset(n); while(m--) { scanf("%d %d",&a,&b); unionset(a,b); } int sum=0; for(i=1;i<=n;i++) { if(uset[i]==i) sum ++; } printf("Case %d: %d\n", t++, sum); } return 0;}
1 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 并查集
- JAVA的时代
- 走向大神之springMVC(一)
- Lua学习一
- Cocos2d-x 自定义血条及其美化----之游戏开发《赵云要格斗》(4)
- OpenGL入门7——两种投影模式
- POJ 2524-Ubiquitous Religions(并查集)
- Android图片异步加载框架Android-Universal-Image-Loader
- 粒子系统
- 9.ios之UIScrollView
- Android四大基本组件(Activity,Service,Content Provider 和 BroadcastReceiver)
- 公用表表达式(CTE)引发的改变执行顺序同WHERE条件顺序引发的bug
- struts2为什么filter不能过滤.action的请求
- JavaSocket聊天器<三>多线程客户端向服务端发送信息
- 第三章思维导图