[2524]Ubiquitous Religions (并查集+哈希) (POJ)
2014-08-25 20:57
393 查看
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
×
关闭划词翻译
复制
复制全部
Online Judge | Problem Set | Authors | Online Contests | User |
---|---|---|---|---|
Language: Default Ubiquitous Religions
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. 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 9 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 10 4 2 3 4 5 4 8 5 8 0 0 Sample Output Case 1: 1 Case 2: 7 #include <stdio.h> #include <string.h> #include <stdlib.h> int father[50100];//根节点 int num[50100];//哈希计数 int fin(int a)//查找根节点 { if(a!=father[a]) a=fin(father[a]);//压缩路径 return a; } void un(int a,int b)//合并 { int x=fin(a); int y=fin(b); if(x!=y) father[y]=x; } int main() { int n,m,i; int a,b; int sum;//根节点的个数; int z=1;//测试组数 while(scanf("%d %d",&n,&m),n) { sum=0; memset(num,0,sizeof(num)); for(i=1;i<=n;i++)//初始化根节点函数 father[i]=i; for(i=0;i<m;i++) { scanf("%d %d",&a,&b); un(a,b); } int t; for(i=1;i<=n;i++) { t=fin(i); num[t]++;//哈希 } for(i=1;i<=n;i++) { if(num[i]>0) sum++; } printf("Case %d: %d\n",z++,sum); } return 0; } |
Any problem, Please Contact Administrator
×
关闭划词翻译
复制
复制全部
相关文章推荐
- [2524]Ubiquitous Religions (并查集+哈希) (POJ)
- POJ 2524 宗教信仰 并查集 基础模板
- POJ 2524 Ubiquitous Religions (并查集 II)
- POJ - 2524 Ubiquitous Religions(简单并查集)
- POJ2524 Ubiquitous Religions(并查集)
- poj2524 Ubiquitous Religions(并查集)
- POJ 2524 Ubiquitous Religions (简单并查集,三种方式)
- POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions(并查集)
- poj 2524 Ubiquitous Religions
- poj 2524 并查集裸
- poj 2524 Ubiquitous Religions 并查集
- POJ 2524----Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- 【原创】poj ----- 2524 Ubiquitous Religions 解题报告
- POJ 2524 Ubiquitous Religions
- POJ2524——并查集
- poj 2524 Ubiquitous Religions (STL与非STL的对比)
- Ubiquitous Religions 【poj-2524】【并查集】
- poj 2524 Ubiquitous Religions