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

    Ubiquitous Religions
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 23262   Accepted: 11464

    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>
    const int MAX = 50001;
    int p[MAX],rank[MAX];
    int result;
    
    int findSet(int x)
    {
    	if(x!=p[x])
    		p[x] = findSet(p[x]);
    	return p[x];
    }
    
    void Union(int x, int y)
    {
    	if(x == y)
    		return;
    	result--;
    	if(rank[x] > rank[y])
    	{
    		p[y] = x;
    	}
    	else
    	{
    		p[x] = y;
    		if(rank[x] == rank[y])
    			rank[y]++;
    	}
    }
    
    int main()
    {
    	int i,j;
    	int s1,s2;
    	int x,y;
    	int n,m;
    	int t = 1;
    	while(true)
    	{
    		scanf("%d %d",&n,&m);
    		if(n==0&&m==0) break;
    		result = n;
    		for(i = 1; i <= n; i++)
    		{
    			p[i] = i;
    			rank[i] = 0;
    		}
    		for(i = 1; i <= m; i++)
    		{
    			scanf("%d %d",&x,&y);
    			s1 = findSet(x);
    			s2 = findSet(y);
    			Union(s1,s2);
    		}
    		printf("Case %d: ",t++);
    		printf("%d
    ",result);
    	}
    	return 0;
    }
    <pre name="code" class="html">#include<iostream>
    using namespace std;
    const int MAX =50001;
    int father[MAX],rank[MAX];
    int result;
    int Find_Set(int x)
    {
    	if(x!=father[x])
    		father[x]=Find_Set(father[x]);
    	return father[x];
    }
    void Union_Set(int x,int y)
    {
    
    	if(x==y)return ;
    	result--;
    	if(rank[x]>rank[y])
    	{
    		father[y]=x;
    	}
    	else 
    	{
    		father[x]=y;
    		if(rank[x]==rank[y])
    			rank[y]++;
    	}
    }
    int main()
    {
    	int n,m;
    	int i,x,y,s1,s2;
    	int num=1;
    	while(true)
    	{
    		cin>>n>>m;	
    		if(n==0&&m==0)break;
    		result = n;
    		for(i=1;i<=n;i++)
    		{
    			father[i]=i;
    			rank[i]=0;
    		}
    		for(i=1;i<=m;i++)
    		{
    			cin>>x>>y;	
    			s1=Find_Set(x);
    	        s2=Find_Set(y);
    			Union_Set(s1,s2);
    		}
    			cout<<"Case "<<num++<<": "<<result<<endl;
    	}
    	return 0;
    }
    


    
       
    
  • 相关阅读:
    关于本人对javascript闭包的理解
    关于闭包内存泄露的处理方法
    javascript超时调用、间歇调用
    浏览器加载和渲染html的顺序
    CSS hack
    JS在操作IE与FF的一些区别
    javascript对select option操作
    jsp端使用ApplicationContext
    人生的35个经典好习惯
    2008个人总结
  • 原文地址:https://www.cnblogs.com/mthoutai/p/6910103.html
Copyright © 2011-2022 走看看