hd2120 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): 797    Accepted Submission(s): 466

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
  
  
  
  

   
    
  
  
  
  

   
   嗯，其实就是找成了几个环，合并的时候flag++就ok了
  
  
  
  

   
   
#include<cstdio>
#define max 10000+10
   
   
#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈，若用递归而不用rank数组爆栈的话
int pre[max];
int rank[max];//rank数组在小希的迷宫里有解释
int flag;
//int find(int x)//31ms递归和rank数组一起的
//{
//	if(x!=pre[x])	pre[x]=find(pre[x]);
//	return pre[x];
//}
int find(int x)//15ms
{
	int a=x;
	while(a!=pre[a])	a=pre[a];
	pre[x]=a;
	return a;
}
//int find(int x)//15ms非递归带路径压缩
//{
//	int a=x,b;
//	while(a!=pre[a])
//		a=pre[a];
//	while(x!=a)
//	{
//		b=pre[x];
//		pre[x]=a;
//		x=b;
//	}
//	return pre[x];
//}
void join(int a,int b)
{
	int fa=find(a);
	int fb=find(b);
	if(fa!=fb)
	{
//		if(rank[fa]<rank[fb])	pre[fa]=fb;
//		else 
//		{
//			pre[fb]=fa;
//			if(rank[fa]==rank[fb])	rank[fa]++;
//		}
		pre[fa]=fb;
	}
	else flag++;
}
int main()
{
	int n,m,a,b;
	while(~scanf("%d%d",&n,&m))
	{
		flag=0;
		for(int i=0;i<n;++i)
		{
			pre[i]=i;
		//	rank[i]=0;
		}
		while(m--)
		{
			scanf("%d%d",&a,&b);
			join(a,b);
		}
		printf("%d\n",flag);
	}
	return 0;
}