zoukankan      html  css  js  c++  java
  • POJ 2524 并查集

    Ubiquitous Religions
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 47081   Accepted: 22112

    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

    ac代码
    #include<iostream>
    #include<cstdio>
    #include<cmath>
    #include<cstring>
    const int maxn=1e5+5;
    typedef long long ll;
    using namespace std;
    int father[50005],a[50005];
    void unionn(int a,int b){
        father[b]=a;
    }
    int find(int x){
        if(father[x]!=x)father[x]=find(father[x]);
        return father[x];
    } 
    int main(){
        int n,x,y;long m;
        scanf("%d%dd",&n,&m);
        int cas=0;
        while(n!=0){ 
        int ans=0;
        cas++;
             memset(a,0,sizeof(a));
            for(int i=1;i<=n;++i)father[i]=i; 
            for(long i=1;i<=m;++i){
                scanf("%d%d",&x,&y);
                int r1=find(x);
                int r2=find(y);
                if(r1!=r2)unionn(r1,r2);
            }
            for(int i=1;i<=n;++i){
                if(father[i]==i)ans++;
            }
            printf("Case %d: %d
    ",cas,ans);
            scanf("%d%d",&n,&m);
        }
        return 0;
    }
  • 相关阅读:
    Delphi中的接口和抽象类
    设计模式之六大原则
    C 标准库
    linux 管道和重定向
    linux c创建静态库(.a)
    一个C语言程序
    C#动态创建lambda表达式
    linq中order by 和group by (含lambda表达式实现)以及综合案例
    微信扫码登陆原理
    二维码扫码支付原理
  • 原文地址:https://www.cnblogs.com/m2364532/p/12394399.html
Copyright © 2011-2022 走看看