Hdu oj 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): 1046    Accepted Submission(s): 619

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

 

Source

HDU 2007-10 Programming Contest_WarmUp
读题绕了一会，读懂之后就很简单了，就是用并查集判断有几个环，if(find(a) == find(b)) cnt++;就可以了

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>

using namespace std;

int pre[1005];
int find (int x)
{
    int r=x;
    while(pre[r]!=r)
        r=pre[r];
    int i=x,j;
    while(i!=r)
    {
        j=pre[i];
        pre[i]=r;
        i=j;
    }
    return r;
}

void join(int x,int y)
{
    int fx=find (x),fy=find (y);
    if(x!=y)
        pre[fx]=fy;
}

int main()
{
    int n,m;
    int i,j,k;
    int a,b;
    while(~scanf("%d%d",&n,&m))
    {
        int cnt=0;
        for(i=0;i<n;i++)
        {
            pre[i]=i;
        }
        for(i=0;i<m;i++)
        {
            scanf("%d%d",&a,&b);
            if(find(a) == find(b))
		cnt++;
            join(a,b);
        }
        printf("%d\n",cnt);
    }

}