poj-2524 Ubiquitous Religions
来源:互联网 发布:淘宝店铺降权有通知吗 编辑:程序博客网 时间:2024/06/14 03:01
E - 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
Hint
Huge input, scanf is recommended.
代码:
#include<stdio.h>int bin[100005];int find(int x){ int r; r=x; while(bin[r]!=r) r=bin[r]; return r;}void bing(int x,int y){ int fx,fy; fx=find(x); fy=find(y); if(fx!=fy) { bin[fx]=fy; }}int main(){ int n,m,x,y,count,d=1; while(scanf("%d%d",&n,&m)!=EOF&&n!=0&&m!=0) { count=n; for(int i=1;i<=n;i++) bin[i]=i; for(int j=1;j<=m;j++) { scanf("%d%d",&x,&y); int fx,fy; fx=find(x); fy=find(y); if(fx!=fy) { bin[fx]=fy; count--; } } printf("Case %d: %d\n",d++,count); } 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
- 读写锁----笛风读书笔记系列
- uva 10128
- 使用python中的HTTPServer创建本地站点
- 程序调试-新手
- 【iOS】BaseController的用处
- poj-2524 Ubiquitous Religions
- 讲讲Mongodb的24位ObjectId的无损压缩
- cocos2d-x应用窗口相关源码剖析2
- 基础练习 01字串
- 基于CAS实现单点登录(SSO):工作原理
- 更改DataTable中的数据
- C语言中变量声明和定义----笛风读书笔记系列
- 数字图像处理—图像分割—并行区域—连通区域标记(像素标记)(4-连通情况)
- android环境搭建