POJ 2524 Ubiquitous Religions(水水的并查集)
来源:互联网 发布:天猫跟淘宝有啥区别 编辑:程序博客网 时间:2024/05/22 13:23
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.
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.
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.
10 91 21 31 41 51 61 71 81 91 1010 42 34 54 85 80 0
Case 1: 1Case 2: 7
Huge input, scanf is recommended.
题解:
并查集炒鸡入门题。。一遍ac,都不想写题解了
代码:
#include<algorithm>#include<iostream>#include<cstring>#include<stdio.h>#include<math.h>#include<string>#include<stdio.h>#include<queue>#include<stack>#include<map>#include<deque>#define M (t[k].l+t[k].r)/2#define lson k*2#define rson k*2+1using namespace std;int pre[50005];int find(int x)//压缩路径+查询根节点{ if(x!=pre[x]) pre[x]=find(pre[x]); return pre[x];}int main(){ int i,j,k,test,m,n,ans=1,x,y,d1,d2,num; while(scanf("%d%d",&n,&m)!=EOF) { if(!n&&!m) break; for(i=1;i<=n;i++) pre[i]=i; num=0; for(i=1;i<=m;i++) { scanf("%d%d",&x,&y); d1=find(x); d2=find(y); if(d1!=d2) { pre[d2]=d1; } } for(i=1;i<=n;i++) { if(pre[i]==i) num++; } printf("Case %d: ",ans); printf("%d\n",num); ans++; } 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 并查集
- CentOS7如何设置防火墙
- HDU6077
- [PAT乙级]1005. 继续(3n+1)猜想 (25)
- Rdd的 foreach 和 foreachPartition
- mongodb简介 安装
- POJ 2524 Ubiquitous Religions(水水的并查集)
- 如何学习JavaScript?
- Fragment可见状态的判断
- NYOJ 86 找球号(一)(二分法)
- 观察者模式(OBSERVER)c++
- MFC 树控件图标未显示完全问题
- POJ 2155 二维树状数组 解题报告
- samba服务及linux与windows文件共享
- DatePickerIOS的使用