HDU - 2120 A - Ice_cream's world I

最新推荐文章于 2019-08-22 21:29:45 发布

Vace___yun

最新推荐文章于 2019-08-22 21:29:45 发布

阅读量199

点赞数

本文链接：https://blog.csdn.net/Vace___yun/article/details/81748425

版权

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
题目大意：给你n个点，k条边，问你这个图有多少个环

思路：当合并两个新的元素时，如果两个元素同父节点，那么合并后必成一个环。

代码：
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int f[1010];
int getf(int v)
{
    if(f[v]==v) return v;
    return f[v]=getf(f[v]);
}
int merge(int a,int b)
{
    int t1=getf(a);
    int t2=getf(b);
    if(t1!=t2)
    {
        f[t2]=t1;
        return 0;  //无环
    }
    return 1;       //有环
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        int a,b,sum=0;
        for(int i=0; i<=n; i++)
            f[i]=i;

        for(int i=0; i<m; i++)
        {
            scanf("%d%d",&a,&b);
            sum+=merge(a,b);
        }
        printf("%d\n",sum);
    }
}