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

 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
using namespace std;
typedef long long ll;
int cnt=0;
int root[1005];
int N,M;
int fid(int x)
{
    if(x==root[x]) return x;
    return root[x]=fid(root[x]);
}
void mix(int x, int y)
{
    int u=fid(x);
    int v=fid(y);
    if(u!=v)
    {
        root[u]=v;
    }
    else cnt++;
}
int main()
{
    while(scanf("%d%d",&N,&M)!=EOF)
    {
        cnt=0;
        for(int i=1; i<=N; i++) root[i]=i;
        while(M--)
        {
            int e1,e2;
            scanf("%d%d",&e1,&e2);
            e1++;
            e2++;
            mix(e1, e2);
        }
        printf("%d\n",cnt);
    }
    return 0;
}