zoukankan      html  css  js  c++  java
  • POJ 2524

    Time Limit: 5000MS Memory Limit: 65536K

    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

    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.

    并查集水题。

     1 #include<cstdio>
     2 #include<set>
     3 using namespace std;
     4 int m,n;
     5 int par[50000+5],rank[50000+5];
     6 void init()  
     7 {  
     8     for(int i=1;i<=n;i++) par[i]=i,rank[i]=0;  
     9 }  
    10 int find(int x)  
    11 {  
    12     if(par[x] == x) return x;  
    13     else return( par[x] = find(par[x]) );  
    14 }  
    15 void unite(int x,int y)  
    16 {  
    17     x=find(x),y=find(y);  
    18     if(x == y) return;  
    19     if(rank[x] < rank[y]) par[x]=y;  
    20     else  
    21     {  
    22         par[y]=x;
    23         if(rank[x] == rank[y]) rank[x]++;  
    24     }  
    25 }  
    26 int main()
    27 {
    28     int cnt=0;
    29     while(scanf("%d%d",&n,&m) && m!=0 && n!=0)
    30     {
    31         init();
    32         for(int i=1;i<=m;i++){
    33             int x,y;
    34             scanf("%d%d",&x,&y);
    35             if(find(x)!=find(y)) unite(x,y);//将两个信仰相同的同学合并 
    36         }
    37         set<int> s;//新建一个用于存所有整一个图中每一个集合的根的set,它的size就是答案 
    38         for(int i=1;i<=n;i++){
    39             s.insert(find(i));
    40         }
    41         printf("Case %d: %d
    ",++cnt,s.size());
    42     }
    43 }



  • 相关阅读:
    Arm的几种工作模式
    Linux 串口驱动初始化前置定位crash log
    GPS的经纬度格式及转换
    git 常用命令
    windows 下 mongodb studio 3t 破解无限使用脚本
    从头开始 一、第一天
    十九、IDEA的pom文件手动添加依赖
    十八、{ "a", "ab", "ac", "abc", "de", "bc", "e" }不使用Arrays.sort()进行排序
    十七、Java中数组常见的几种排序方法!
    十六、IDEA创建一个maven工程
  • 原文地址:https://www.cnblogs.com/dilthey/p/6804148.html
Copyright © 2011-2022 走看看