poj 2524 Ubiquitous Religions
2016-02-16 16:24
344 查看
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.
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
Sample Output
Hint
Huge input, scanf is recommended.
简单的并查集利用;
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
Hint
Huge input, scanf is recommended.
简单的并查集利用;
#include<iostream> #include<cstdlib> #include<string> #include<algorithm> #include<cstdio> #include<cmath> #include<cstring> #include<stack> #include<queue> #include<iomanip> #include<map> #define pi 3.14159265358979323846 using namespace std; int pre[50005]; int ans; int find(int x) { if(x!=pre[x]) pre[x]=find(pre[x]); return pre[x]; } void unions(int x,int y) { int a,b; a=find(x); b=find(y); if(a!=b) { pre[a]=b; --ans; } } int main() { int n,m; int cnt=0; while(scanf("%d %d",&n,&m)!=EOF&&(n||m)) { for(int i=1;i<=n;++i) pre[i]=i; int a,b; ans=n; for(int i=0;i<m;++i) { scanf("%d %d",&a,&b); unions(a,b); } printf("Case %d: %d\n",++cnt,ans); } return 0; }
相关文章推荐
- 8VC Venture Cup 2016 -A - Robot Sequence/B - Cards
- Java基础——数组应用之StringBuilder类和StringBuffer类
- ContentValues的用法
- UITabBarController自定义一
- NGUI制作字体的三种方法
- Kbuild
- iPads和iPhones的Media Queries
- UICollectionView使用以及与UITableView的区别
- JAVA 生成uuid
- IOS学习 UIView 页面布局
- SOUI GDI+渲染引擎下的字体特效
- iOS对UIView对象或子类对象截屏(截取的内容以UIImage的形式存储)
- UICollectionView基础
- 降低对象的引用级别到软引用 class SoftValueMap<K, V> extends HashMap<K, V>
- nyoj--1100--WAJUEJI which home strong!(bfs)
- nyoj--1100--WAJUEJI which home strong!(bfs)
- android 开源组件合集-UI篇(2014-08-25更新)
- MySQL关于Value '0000-00-00 00:00:00' can not be represented as java.sql.Timestamp
- UITextView控件的用法
- easyUI datagird实现对行的任意拖拽移动位置