zoukankan      html  css  js  c++  java
  • poj2524

    Language:
    Ubiquitous Religions
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 20242   Accepted: 9938

    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
     1 #include<stdio.h>
     2 int bin[10000001];
     3 
     4 int find(int x)
     5 {
     6     int r=x;
     7     while(bin[r]!=r)
     8     r=bin[r];
     9     return r;
    10 }
    11 
    12 void merge(int x,int y)
    13 {
    14     int fx,fy;
    15     fx=find(x);
    16     fy=find(y);
    17     if(fx!=fy)
    18     bin[fx]=fy;
    19 }
    20 int main()
    21 {
    22     int n,m,i,x,y,count,k=1;
    23     while(~scanf("%d %d",&n,&m))
    24     {
    25         if(n==0&&m==0)break;
    26         for(i=1;i<=n;i++)
    27         bin[i]=i;
    28         for(i=m;i>0;i--)
    29         {
    30             scanf("%d %d",&x,&y);
    31             merge(x,y);
    32         }
    33         for(count=0,i=1;i<=n;i++)
    34         {
    35             if(bin[i]==i)count++;
    36         }
    37         printf("Case %d: %d\n",k++,count);
    38     }
    39     return 0;
    40 }
    View Code
  • 相关阅读:
    进程DLL注入
    静态链接库LIB
    利用MoveFileEx实现程序的隐藏、自启动与自删除
    QueueUserApc实现DLL注入的测试
    简单说说SSDT
    ural 1521. War Games 2 约瑟夫环 SBT实现
    次小生成树 (附:poj1679)
    hoj 1138 LC Display
    hoj 3029 Dictionary 模拟队列
    hoj 2578 Super_Stack 模拟栈
  • 原文地址:https://www.cnblogs.com/sdutmyj/p/3222562.html
Copyright © 2011-2022 走看看