Class DSU

MinimizeHammingDistance/MinimizeHammingDistance.cpp:7–26

============================ Disjoint Set Union (Union-Find) ============================

// Disjoint Set Union (Union-Find)
// ============================
class DSU {
public:
    vector<int> parent, rank;
    DSU(int n) {
        parent.resize(n);
        rank.resize(n, 0);
        for (int i = 0; i < n; i++) parent[i] = i;
    }
    int find(int x) {
        if (parent[x] != x) parent[x] = find(parent[x]);
        return parent[x];
    }
    void unite(int x, int y) {
        int rx = find(x), ry = find(y);
        if (rx == ry) return;
        if (rank[rx] < rank[ry]) parent[rx] = ry;
        else if (rank[ry] < rank[rx]) parent[ry] = rx;
        else parent[ry] = rx, rank[rx]++;
    }
};

// ============================
// Solution Class