hdu 2120 Ice_cream's world I

最新推荐文章于 2019-10-06 08:15:24 发布

GadyPu

最新推荐文章于 2019-10-06 08:15:24 发布

阅读量244

点赞数

分类专栏：并查集

本文链接：https://blog.csdn.net/u012077152/article/details/48296101

版权

并查集专栏收录该内容

8 篇文章 0 订阅

订阅专栏

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=2120
用并查集统计环的个数。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map>
using std::map;
using std::min;
using std::find;
using std::pair;
using std::vector;
using std::multimap;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define cls(arr, val) memset(arr, val, sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define tr(c, i) for(iter(c) i = (c).begin(); i != (c).end(); ++i)
const int N = 1010;
const int INF = 0x3f3f3f3f;
struct UinonFind {
    int ans, par[N], rank[N];
    inline void init(int n) {
        ans = 0;
        rep(i, n + 1) {
            par[i] = i;
            rank[i] = 0;
        }
    }
    inline int find(int x) {
        while(x != par[x]) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    inline void unite(int x, int y) {
        x = find(x), y = find(y);
        if(x == y) { ans++; return; }
        if(rank[x] < rank[y]) {
            par[x] = y;
        } else {
            par[y] = x;
            rank[x] += rank[x] == rank[y];
        }
    }
    inline void solve(int n, int m) {
        init(n);
        int x, y;
        while(m--) {
            scanf("%d %d", &x, &y);
            unite(x, y);
        }
        printf("%d\n", ans);
    }
}go;
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int n, m;
    while(~scanf("%d %d", &n, &m)) {
        go.solve(n, m);
    }
    return 0;
}