POJ2524:Ubiquitous Religions (并查集模板)
2016-04-12 19:47
387 查看
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
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 <iostream> #include <cstring> #include <cstdio> using namespace std; int pre[50005]; bool t[50005]; int _find(int x) { int r=pre[x]; while(r!=pre[r]) r=pre[r]; int i,j; i=x; while(pre[i]!=r) { j=pre[i]; pre[i]=r; i=j; } return r; } void mix(int x,int y) { int fx=_find(x),fy=_find(y); if(fx!=fy) pre[fy]=fx; } int main() { int n,m,a,b,ans,CASE=0; while(cin>>n>>m) { if(n==0&&m==0) break; ans=0; CASE++; for(int i=0;i<=n;i++) pre[i]=i; for(int i=1;i<=m;i++) { cin>>a>>b; mix(a,b); } memset(t,false,sizeof(t)); for(int i=1;i<=n;i++) t[_find(i)]=true; for(int i=1;i<=n;i++) if(t[i]==true) ans++; printf("Case %d: %d\n",CASE,ans); } return 0; }
相关文章推荐
- [置顶] JavaSE学习笔记_19:Java-GUI
- UIButton相关设置
- Xcode中添加UITableView后设置cell高度无法达到期望值的解决办法
- LeetCode *** 62. Unique Paths
- 62. Unique Paths
- easyUI框架下实现日期按年,年月,年月日方式显示
- 文章标题WERTYUIOP[ 每日一到算法题]
- D. Longest Subsequence
- D. Longest Subsequence
- Java之——生成短8位UUID
- 利用localStorage实现对ueditor编辑内容定时保存为草稿
- Cannot assign requested address解决办法
- uva 1152 4 values whose sum is zero ——yhx
- Light OJ 1061 N Queen Again
- 对于初学iOS开发者有用之在UITableView的导航栏中加入Item的方法
- HUE配置zookeeper,HDFS报错Failed to access filesystem root解决
- runOnUiThread-----startAnimation
- mybatis result maps collection already contains value解决办法
- iOS 基于runtime 解决UIButton重复点击 发送多次请求问题
- You must rebuild it with bitcode enabled (Xcode setting ENABLE_BITCODE)