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

    Ubiquitous Religions
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 24111   Accepted: 11881

    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



    简单并查集。


    #include <iostream>
    #include <cstring>
    #define maxn 50010
    using namespace std;
    int f[maxn];
    int find(int x)
    {
    	 return x == f[x] ?

    x : (f[x] = find(f[x])); } int main() { int n,m; int N; N=1; while(cin>>n>>m&&n||m) { int i; for(i=1;i<=n;i++) f[i]=i; for(i=1;i<=m;i++) { int x,y; cin>>x>>y; int fx,fy; fx=find(x); fy=find(y); if(fx!=fy) f[fx]=fy; } int sum=0; for(i=1;i<=n;i++) { if(f[i]==i) sum=sum+1; } cout << "Case " <<N<<": "<<sum<< endl; N++; } return 0; }





    版权声明:本文博客原创文章,博客,未经同意,不得转载。

  • 相关阅读:
    应急响应中find命令总结
    应急响应排查思路
    硬链接与软链接的区别
    Linux开机启动项总结
    android 開發常用網站
    epoll
    Qualcomm platform, the commonly used parameters of charger and battery in device tree file
    why not ovp protection ?
    Performance tuning
    Using adb over wifi
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/4635822.html
Copyright © 2011-2022 走看看