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

    Ubiquitous Religions
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 22972   Accepted: 11331

    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<stdio.h>
    #include<string.h>
    
    int f[50005],vis[50005];
    int find (int x)
    {
        if(f[x]==x)
            return f[x];
        else return find(f[x]);
    }
    
    int main()
    {
        int n,m;
        int i,j;
        int a,b,c;
    
        int ans,cas=0;
        while(~scanf("%d%d",&n,&m)&&(n||m))
        {
            cas++;
            memset(vis,0,sizeof vis);
            ans=0;
            for(i=1;i<=n;i++)
                f[i]=i;
            for(i=1;i<=m;i++)
            {
                scanf("%d%d",&a,&b);
                a=find (a);
                b=find (b);
                f[a]=b;
            }
            for(i=1;i<=n;i++)
            {
                c=find(i);
                if(!vis[c])
                {ans++;vis[c]=1;}
            }
            printf("Case %d: %d
    ",cas,ans);
        }
        return 0;
    }
    



  • 相关阅读:
    Windows打开软件老是弹出无法验证发布者
    SpringMvc接受特殊符号参数被转义
    时代更替中的方正
    你应该知道的c# 反射详解
    C#使用System.Data.SQLite操作SQLite
    C# 动态调用WebService
    C# API: 生成和读取Excel文件
    11个强大的Visual Studio调试小技巧
    .Net 垃圾回收和大对象处理
    Visual Studio原生开发的10个调试技巧(一)
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/4590300.html
Copyright © 2011-2022 走看看