【HDU】-2120-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): 1235    Accepted Submission(s): 743

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
  
  

 

题解：判断图里有多少环即可。

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int f[100010]; 
int find(int x)
{
	if(x!=f[x])
		f[x]=find(f[x]);
	return f[x];
}
bool join(int x,int y)
{
	int dx=find(x);
	int dy=find(y);
	if(dx!=dy)
	{
		f[dx]=dy;
		return true;
	}
	return false;
}
int main()
{
	int n,m;
	bool flag;
	while(~scanf("%d %d",&n,&m))
	{		
		flag=true;			
		int ant=0;
		for(int i=0;i<=1010;i++)
			f[i]=i;
		int a,b;
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d",&a,&b);
			flag=join(a,b);
			if(!flag)		//如果相连之前根节点相同那么相连就有回路，ant++ 
			{
				ant++;
				flag=true;	//注意把 flag 返回真 
			}
		}
		printf("%d\n",ant);
	}
	return 0;
}