浙大上机题--畅通工程

简单的并查集，主要复习模板

题目链接

#include <iostream>

using namespace std;
const int N = 1010;

int f[N];

int find(int x) {
    if (x != f[x]) return f[x] = find(f[x]);
    return f[x];
}

void merge(int a, int b) {
    int ta = find(a);
    int tb = find(b);
    if (ta != tb) {
        f[tb] = ta;
    }
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
#endif
    int n, m;
    while (cin >> n >> m) {
        for (int i = 1; i <= n; i++) f[i] = i;
        for (int i = 0; i < m; i++) {
            int a, b;
            cin >> a >> b;
            merge(a, b);
        }
        int cnt = 0;
        for (int i = 1; i <= n; i++) {
            if (f[i] == i) cnt++;
        }
        cout << cnt - 1 << endl;
    }

    return 0;
}