sdut 2428 Ubiquitous Religions(最小生成树)
2016-02-24 15:19
387 查看
Ubiquitous Religions
Time Limit: 1000MS Memory limit: 65536K
题目描述
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.
输入
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.
输出
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.
示例输入
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
示例输出
Case 1: 1 Case 2: 7
#include <stdio.h> #include <string.h> int f[50010]; int Find(int x) { return x == f[x] ? x : Find(f[x]); } void Link(int x, int y) { int fx = Find(x); int fy = Find(y); if(fx != fy) f[fx] = fy; } void Init(int n) { for(int i=1; i<=n; i++) f[i] = i; } int main() { int n, m; int cas = 0; while(~scanf("%d %d",&n, &m) && (m || n)) { Init(n); while(m--) { int u,v; scanf("%d %d",&u, &v); Link(u, v); } int ant = 0; for(int i=1; i<=n; i++) if(f[i] == i) ant++; printf("Case %d: %d\n",++cas, ant); } return 0; }
相关文章推荐
- UIActivityViewController 系统社交化 共享
- dom4j解析xml报错:Nested exception: org.xml.sax.SAXParseException: White space is required between the processing instruction target and data.
- 使用easyui实现双击列表中某个值直接对其进行修改
- UIDynamic
- *** Assertion failure in -[UICollectionViewData validateLayoutInRect:]
- Android之MessageQueue、Looper、Handler与消息循环
- 1.String、Stringbuffer、Stringbuilder之间的区别。
- 0777前面的0原来是叫个suid和guid的东西
- 使用UGUI制作血条中Slider的value控制
- Android Stuido Ndk-Jni 开发(三):Jni基本语法
- 默认系统为UEFI启动的GPT分区的WIN7(8),如何安装VHD的UEFI WIN8(7)
- iOS UIScrollView不能响应touchBegin的解决方法
- Android Stuido Ndk-Jni 开发(二):Jni中打印log信息
- iOS UITextFiled设置样式为有下划线的那种
- iOS-OC-UISearchBar取消搜索状态
- Gradle构建项目时,将敏感信息保存在build.gradle之外
- Android Stuido Ndk-Jni 开发(一):创建简单的JniDemo
- 最长上升子序列 LIS (Longest Increasing Subsequence)
- Android Studio中的错误,finished with non-zero exit value 1
- UIAlertController 部分用法及属性