Ubiquitous Religions
来源:互联网 发布:非诚勿扰程序员死亡 编辑:程序博客网 时间:2024/06/06 07:51
D - Ubiquitous Religions
Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
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
这个题相当于是问你有多少个连通分量,没什么好说的....
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n,m;int pre[50005];int findx(int x){ int r=x; while(r!=pre[r]) { r=pre[r]; } int k; while(pre[x]!=r) { k=pre[x]; pre[x]=r; x=k; } return r;}void he(int x,int y){ int fx=findx(x); int fy=findx(y); if(fx!=fy)pre[fy]=fx;}int main(){ int t=0; while(1) { t++; int i; scanf("%d%d",&n,&m); if(n==0&&m==0)break; for(i=1;i<=n;++i)pre[i]=i; int x,y; while(m--) { scanf("%d%d",&x,&y); he(x,y); } int sum=0; for(i=1;i<=n;++i) { if(pre[i]==i)sum++; } printf("Case %d: %d\n",t,sum); } return 0;}
0 0
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- 蓝牙的规格,蓝牙的配置文件,中英文文档,Bluetooth profiles
- 窗体最小化到系统托盘
- HDU 5363 Key Set(快速幂)
- 快速排序算法在字符排序中的应用
- MySql 纵表转横表
- Ubiquitous Religions
- Android用户界面UI总结
- php反射代码
- 基本的线程机制
- [笔记]java应用程序窗口关闭的六种方式
- 获取图片的宽高
- 排序算法讲解(二)
- bfs和bfs
- HDOJ-5363 Key Set