Ice_cream's world I 【HDU - 2120 】

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

题意：

用并查集判断环。

分割冰奶油世界的土地，一堵墙包围的土地必须只给一个ACMer，如果你能帮助女王解决这个问题，你将得到一块土地。

两个整数N, M (N<=1000, M<=10000)表示瞭望塔数和墙数。瞭望塔的编号从0到N-1。在M行之后，每一行都包含两个整数A, B表示A和B之间有一堵墙(A和B是不同的)。以文件结尾结束。

输出将被授予的ACMers的最大数量。

一个答案一行。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

int n,m,x,y;
int f[1010];

int init()
{
    for(int i=0; i<n; i++)
        f[i]=i;
    return f[n];
}

int getf(int k)
{
    if(f[k]==k)
        return k;
    return
        f[k]=getf(f[k]);
}

bool merge(int a,int b)
{
    a=getf(a);
    b=getf(b);
    if(a!=b)
    {
        f[b]=a;
        return false;
    }
    return true;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        init();
        int sum=0;
        for(int i=0; i<m; i++)
        {
            scanf("%d%d",&x,&y);
            if(merge(x,y))
                sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}