zoukankan      html  css  js  c++  java
  • POJ – 2524 Ubiquitous Religions

    Ubiquitous Religions

    Time Limit: 5000MS
    Memory Limit: 65536KB
    64bit IO Format: %I64d & %I64u

    [Submit]   [Go Back]   [Status

    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.

    Source

    Alberta Collegiate Programming Contest 2003.10.18

     

    输入总数和两两关系,算出总共的等价类数

     

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<string>
    #include<algorithm>
    using namespace std;
    
    const int maxn=50000+5;
    int p[maxn], rank[maxn];
    int n,m;
    int ans;
    
    void make_set()
    {
        for(int i=1;i<=n;i++)
        {
            p[i]=i;
            rank[i]=0;
        }
    }
    
    int find_set(int x)
    {
        return p[x]!=x ? p[x]=find_set(p[x]) : x;
    }
    
    void union_set(int x, int y)
    {
        int fx=find_set(x), fy=find_set(y);
        if(fx==fy) return;
        if(rank[fx]<rank[fy])
        {
            p[fx]=fy;
        }
        else
        {
            p[fy]=fx;
            if(rank[fx]==rank[fy]) rank[fx]++;
        }
        ans--;
    }
    
    int main()
    {
        int kase=0;
        while(scanf("%d%d", &n, &m)==2 && (n || m)) {
            ans=n;
            make_set();
            for(int i=0;i<m;i++) {
                int x,y; 
                scanf("%d%d", &x, &y);
                union_set(x, y);
            }
    #if 0
            ans=0;
            for(int i=1;i<=n;i++) if(p[i]==i) ans++;
    #endif
            printf("Case %d: %d
    ", ++kase, ans);
        }
    
        return 0;
    }
  • 相关阅读:
    calc PI
    c# 设置水印,消除水印
    设置windows10 背景颜色
    C# 获取当前路径
    反编译工具
    c# 窗口API,以及全屏锁定一些tips
    c# 几种singleton 实现
    List<T> JIT 分配策略
    软件工程
    mariaDB 安装/卸载+启动/关闭 服务
  • 原文地址:https://www.cnblogs.com/cute/p/3904990.html
Copyright © 2011-2022 走看看