Submission #19723874

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define rrep(i,n) for(int i = int(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int dx[] = {1, 0,-1, 0, 1, 1,-1,-1};
int dy[] = {0, 1, 0,-1, 1,-1, 1,-1};
ll mod = 998244353;
ll MOD = 1000000007;
int inf = 1001001001;
ll INF = 1001001001001001001;
struct UnionFind {
    vector<int> par, size;
    UnionFind(int x) {
        par.resize(x);
        size.resize(x, 1);
        for(int i = 0; i < x; i++) {
            par[i] = i;
        }
    }
    int find(int x) {
        if(par[x] == x) {
            return x;
        }
        return par[x] = find(par[x]);
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    int consize(int x) {
        return size[find(x)];
    }
    void unite(int x, int y) {
        x = find(x);
        y = find(y);
        if(x == y) {
            return;
        }
        if(size[x] < size[y]) {
            par[x] = y;
            size[y] += size[x];
        }
        else {
            par[y] = x;
            size[x] += size[y];
        }
    }
};
int main() {
    int N;
    cin >> N;
    vector<int>a(N),b(N);
    map<int,int>number;
    UnionFind uf(N);
    rep(i,N) {
        cin >> a[i] >> b[i];
        if(number.count(a[i])) {
            uf.unite(number[a[i]],i);
        }
        if(number.count(b[i])) {
            uf.unite(number[b[i]],i);
        }
        number[a[i]] = i;
        number[b[i]] = i;
    }
    map<int,set<int>>color;
    rep(i,N) {
        color[uf.find(i)].insert(a[i]);
        color[uf.find(i)].insert(b[i]);
    }
    int ans = 0;
    for(pair<int,set<int>>x:color) {
        ans += min(uf.consize(x.first),(int)x.second.size());
    }
    cout << ans << endl;
}

Submission Info

Judge Result