hdoj2120 Ice_cream's world I【并查集】

Ice_cream's world I

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 832    Accepted Submission(s): 484

Problem Description

ice_cream's world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers are set up, and wall between watchtowers be build, in order to partition the ice_cream’s world. But how many ACMers at most can be awarded by the queen is a big problem. One wall-surrounded land must be given to only one ACMer and no walls are crossed, if you can help the queen solve this problem, you will be get a land.

 

Input

In the case, first two integers N, M (N<=1000, M<=10000) is represent the number of watchtower and the number of wall. The watchtower numbered from 0 to N-1. Next following M lines, every line contain two integers A, B mean between A and B has a wall(A and B are distinct). Terminate by end of file.

 

Output

Output the maximum number of ACMers who will be awarded.
One answer one line.

 

Sample Input

  
  

   
   8 10
0 1
1 2
1 3
2 4
3 4
0 5
5 6
6 7
3 6
4 7
  
  

 

Sample Output

  
  

   
   3
  
  

 

Author

Wiskey

分析:

实际上就是组成环的个数。

代码：

#include<cstdio>
#include<cstring>
#include<cstdlib>
#define N  1010;
#define M  10100
using namespace std;

int pre[M];
int ans;

int find(int n)
{
	int r=n;
	while(r!=pre[r])
	r=pre[r];
	return r;
}
void join(int x,int y)
{
	int f1,f2;
	f1=find(x);
	f2=find(y);
	if(f1!=f2)
	pre[f1]=f2;
	else      //最精华的一步，如果这俩个数的根已经存在并相等， 那就说明组成了环。 
	ans++;
}

int main()
{
	int n,m;
	while(scanf("%d",&n)!=EOF)
	{
		ans=0;
		for(int i=0;i<n;i++)
		pre[i]=i;
		scanf("%d",&m);
		 int a,b;
		for(int i=0;i<m;i++)
		{
			scanf("%d %d",&a,&b);
			join(a,b);
		}
		printf("%d\n",ans);
	}
	return 0;
}