zoukankan      html  css  js  c++  java
  • Ubiquitous Religions(friends变形)

    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
    
     
     

    #include <iostream> #include <algorithm> using namespace std; int p[60000],c[60000]; int find(int x) {return p[x]==x ? x : p[x]=find(p[x]); } int main() {  int t=1,i,x,y; int m,n;   while(cin>>m>>n,m!=0)

     {      for(i=1;i<=m;i++)   {p[i]=i;c[i]=0;}   for(i=1;i<=n;i++)   {  cin>>x>>y;   x=find(x);   y=find(y);   if(x!=y)    p[x]=y;   }   for(i=1;i<=m;i++)   {x=find(i);   c[i]=x;   }   

    sort(c,c+m);

      int max=1;         for(int i=2; i<=m; i++)             if(c[i]!=c[i-1])                 max++;    

           cout<<"Case "<<t<<": "<<max<<endl;    t++;  }  return 0; }

  • 相关阅读:
    csrf攻击 xss区别
    同源策略
    JavaScript中数组的排序——sort()
    箭头函数
    bind(),call(),apply()
    异步操作
    slice(), splice(),split(),indexOf(),join(),replace()
    04-Linux系统编程-第01天(文件IO、阻塞非阻塞)
    03-Linux命令基础-第03天(makefile、静态库、动态库、gdb调试工具)
    02-Linux命令基础-第02天(压缩包管理、服务器搭建与使用、vim)
  • 原文地址:https://www.cnblogs.com/lengxia/p/4387819.html
Copyright © 2011-2022 走看看