CPMagical CP Library

Problem solution · C++

Incremental Even Weighted Cycle Queries

Incremental Even Weighted Cycle Queries: a C++ solution using disjoint set union. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Disjoint set union
Source
Kamyu LeetCode Solutions
Length
59 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Disjoint set union

For Incremental Even Weighted Cycle Queries, the implementation maintains connected components and merges them as relationships are processed.

  1. Give each element a component representative.
  2. Merge representatives when a connection is accepted.
  3. Answer connectivity or component queries from the compressed representatives.

Code notes

  • 59 lines of C++ from the credited upstream file incremental-even-weighted-cycle-queries.cpp.
  • The implementation visibly relies on sequence storage.
  • 1 loop block detected.

Complexity

Account for every find and union operation; with path compression and ranked merging, the amortized cost is nearly constant per operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeIncremental Even Weighted Cycle Queries · C++C++
Use this to learn the idea, then write your own version.
// Time:  O(n + e)// Space: O(n) // union findclass Solution {public:    int numberOfEdgesAdded(int n, vector<vector<int>>& edges) {        int result = 0;        UnionFind uf(n);        for (const auto& e : edges) {            if (uf.union_set(e[0], e[1], e[2])) {                ++result;            }        }        return result;    } private:    class UnionFind {    public:        UnionFind(int n)         : set_(n)         , rank_(n)         , parity_(n) {  // added            iota(begin(set_), end(set_), 0);        }         int find_set(int x) {            if (set_[x] != x) {                const int root = find_set(set_[x]);                parity_[x] ^= parity_[set_[x]];  // added                set_[x] = root;            }            return set_[x];        }         bool union_set(int x, int y, int w) {            const int x0 = x, y0 = y;            x = find_set(x), y = find_set(y);            if (x == y) {                return parity_[x0] ^ w ^ parity_[y0] == 0;  // modified            }            if (rank_[x] > rank_[y]) {                swap(x, y);            } else if (rank_[x] == rank_[y]) {                ++rank_[y];            }            set_[x] = y;  // Union by rank.            parity_[x] = parity_[x0] ^ w ^ parity_[y0];  // added            return true;        }     private:        vector<int> set_;        vector<int> rank_;        vector<int> parity_;  // added    };};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗