POJ 2524 并查集

最新推荐文章于 2017-05-30 13:41:10 发布

Nicetomeetu-

最新推荐文章于 2017-05-30 13:41:10 发布

阅读量287

点赞数

分类专栏： ACM-并查集文章标签： POJ 2524 并查集 csdn

本文链接：https://blog.csdn.net/ECNU_LZJ/article/details/53150496

版权

ACM-并查集专栏收录该内容

4 篇文章 0 订阅

订阅专栏

最基本的并查集，没什么说的

#include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <fstream>
#include <istream>
#include <ostream>
#include <complex>
#include <cstring>
#include <utility>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <new>
#include <set>
#include <map>

using namespace std;

const int maxn = 200000 + 5;
const int INF = 0x3f3f3f3f;
typedef long long int LL;
typedef vector<int> vec;
int p[maxn];

int find_root(int x){
    if (p[x] == x)
        return x;
    return p[x] = find_root(p[x]);
}

int main()
{
    //freopen("1.txt", "r", stdin);
    int n, m, Case = 1;
    while (scanf("%d%d", &n, &m), n && m){
        for (int i = 1; i <= n; i++)
            p[i] = i;
        int x, y;
        for (int i = 0; i < m; i++){
            scanf("%d%d", &x, &y);
            int rx = find_root(x);
            int ry = find_root(y);
            if (rx != ry)
                p[ry] = rx;
        }
        int ans = 0;
        for (int i = 1; i <= n; i++){
            if (p[i] == i)
                ans++;
        }
        printf("Case %d: %d\n", Case++, ans);
    }
    return 0;
}