zoukankan      html  css  js  c++  java
  • NOIP前夕:noi.openjudge,Ubiquitous Religions

    Ubiquitous Religions
    总Time Limit: 5000msMemory Limit: 65536kB
    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.
    
    
    
    
    一道分类为图论的题,实际上就是并查集;
    最后判断有多少棵树即可;
    主要考察并查集的路径压缩和查询
    find和union
    code:
    var i,j,k:longint;
        father:array[1..50000]of longint;
        used:array[1..50000]of boolean;
        n,m:longint;
        x,y:longint;
        ans:longint;
        c:longint;
    
    function find(x:longint):longint;
             begin if x=father[x]
                      then exit(x)
                      else begin father[x]:=find(father[x]);
                                 exit(father[x]);
                           end;
             end;
    
    procedure union(x,y:longint);
              begin father[find(x)]:=find(father[y]);
              end;
    
    begin c:=0;
          readln(n,m);
          while (n<>0)and(m<>0) do
          begin
    
          inc(c);
          for i:=1 to n do
              father[i]:=i;
          for i:=1 to m do
              begin readln(x,y);
                    if find(x)<>find(y)
                       then union(x,y);
              end;
          ans:=0;
          fillchar(used,sizeof(used),true);
          for i:=1 to n do
              begin if used[find(i)]
                       then begin used[find(i)]:=false;
                                  inc(ans);
                            end;
              end;
          writeln('Case ',c,': ',ans);
          readln(n,m);
    
          end;
    end.
  • 相关阅读:
    乌龟棋 (codevs 1068)题解
    全排列 (codevs 1294)题解
    最小伤害 题解
    编码问题 题解
    基础DAY3-运算符 逻辑运算符 if elif
    图解算法——合并k个排序列表(Merge k Sorted Lists)
    算法图解——组合求和( Combination Sum)
    make命令使用 & makefile编写详解
    并发工具CountDownLatch源码分析
    线程局部变量ThreadLocal实现原理
  • 原文地址:https://www.cnblogs.com/spiderKK/p/4928392.html
Copyright © 2011-2022 走看看