test/data_structure/unionfind.test.cpp

View this file on GitHub
Last update: 2025-11-15 20:52:05+09:00
Problem: https://judge.yosupo.jp/problem/unionfind

Depends on

Required by

test/utility/next_combination.test.cpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"

#include "../../data_structure/union_find.hpp"
#include "../../template/template.hpp"

int main() {
    int N, Q;
    cin >> N >> Q;

    UnionFind uf(N);

    while (Q--) {
        int t, u, v;
        cin >> t >> u >> v;

        if (t == 0) {
            uf.merge(u, v);
        } else {
            cout << (uf.same(u, v) ? 1 : 0) << LF;
        }
    }

    return 0;
}

#line 1 "test/data_structure/unionfind.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"

#line 2 "data_structure/union_find.hpp"

#line 2 "template/template.hpp"

/**
 * @author ku_senjan
 * @title 提出用テンプレート
 * @see https://github.com/kogetsu0728/ku-library
 */

#line 2 "template/constant.hpp"

#line 2 "template/include.hpp"

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>
using namespace std;
#line 2 "template/type_alias.hpp"

#line 4 "template/type_alias.hpp"

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;

using ld = long double;

template <class T, bool REVERSE = false>
using heap = priority_queue<T, vector<T>, conditional_t<REVERSE, greater<T>, less<T>>>;
#line 5 "template/constant.hpp"

template <class T>
inline constexpr T INF = numeric_limits<T>::max() / 2;

inline constexpr array<int, 4> DY4 = {0, -1, 0, 1};
inline constexpr array<int, 4> DX4 = {1, 0, -1, 0};
inline constexpr array<int, 8> DY8 = {0, -1, -1, -1, 0, 1, 1, 1};
inline constexpr array<int, 8> DX8 = {1, 1, 0, -1, -1, -1, 0, 1};

inline constexpr char LF = '\n';
#line 2 "template/macro.hpp"

#line 5 "template/macro.hpp"

/**
 * @see https://trap.jp/post/1224/
 */

#ifdef LOCAL
inline constexpr bool IS_LOCAL = true;
#else
inline constexpr bool IS_LOCAL = false;
#endif

#define IF_LOCAL if constexpr (IS_LOCAL)

#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)

#define overload4(a, b, c, d, e, ...) e

#define rep1(i, a) for (ll i = 0; (i) < (ll)(a); ++(i))
#define rep2(i, a, b) for (ll i = (ll)(a); (i) < (ll)(b); ++(i))
#define rep3(i, a, b, c) for (ll i = (ll)(a); (i) < (ll)(b); (i) += (ll)(c))
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep1(i, a) for (ll i = (ll)(a); (i) >= 0; --(i))
#define rrep2(i, a, b) for (ll i = (ll)(a); (i) >= (ll)(b); --(i))
#define rrep3(i, a, b, c) for (ll i = (ll)(a); (i) >= (ll)(b); (i) -= (ll)(c))
#define rrep(...) overload4(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)
#line 13 "template/template.hpp"

#line 2 "utility/choose_min_max.hpp"

/**
 * @title Choose Minimum / Maximum
 */

template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }

    return false;
}

template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }

    return false;
}
#line 2 "utility/set_io.hpp"

#line 4 "utility/set_io.hpp"

void set_io(int d = 16) {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(d);

    return;
}
#line 4 "data_structure/union_find.hpp"

namespace _UnionFind {
using S = bool;
S op(S a, S b) {
    return a ^ b;
}
S e() {
    return false;
}
};  // namespace _UnionFind

/**
 * @brief Union Find
 */
template <class S = _UnionFind::S,
          S (*op)(S, S) = _UnionFind::op,
          S (*e)() = _UnionFind::e>
class UnionFind {
  private:
    int n, comp;
    vector<int> par;
    vector<S> val;

  public:
    UnionFind() : UnionFind(0) {}
    UnionFind(int _n) : n(_n), comp(_n), par(_n, -1), val(_n, e()) {}

    int size() const { return comp; }

    int size(int x) { return -par[leader(x)]; }

    int leader(int x) {
        if (par[x] < 0)
            return x;
        return par[x] = leader(par[x]);
    }

    bool same(int x, int y) { return leader(x) == leader(y); }

    bool merge(int x, int y) {
        x = leader(x);
        y = leader(y);
        if (x == y)
            return false;

        if (par[x] > par[y])
            swap(x, y);

        comp--;
        par[x] += par[y];
        par[y] = x;
        val[x] = op(val[x], val[y]);

        return true;
    }

    vector<vector<int>> groups() {
        vector<vector<int>> mem(n), res;

        rep (i, 0, n) {
            mem[leader(i)].emplace_back(i);
        }

        rep (i, 0, n) {
            if (!mem[i].empty()) {
                res.emplace_back(mem[i]);
            }
        }

        return res;
    }

    void set(int x, S v) {
        val[leader(x)] = v;

        return;
    }

    S get(int x) { return val[leader(x)]; }
};
#line 5 "test/data_structure/unionfind.test.cpp"

int main() {
    int N, Q;
    cin >> N >> Q;

    UnionFind uf(N);

    while (Q--) {
        int t, u, v;
        cin >> t >> u >> v;

        if (t == 0) {
            uf.merge(u, v);
        } else {
            cout << (uf.same(u, v) ? 1 : 0) << LF;
        }
    }

    return 0;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	5 ms	3 MB
g++	max_random_00	AC	295 ms	4 MB
g++	max_random_01	AC	305 ms	4 MB
g++	max_random_02	AC	305 ms	3 MB
g++	path_00	AC	230 ms	4 MB
g++	path_01	AC	251 ms	4 MB
g++	path_02	AC	106 ms	4 MB
g++	path_03	AC	106 ms	4 MB
g++	random_00	AC	277 ms	4 MB
g++	random_01	AC	166 ms	4 MB
g++	random_02	AC	128 ms	4 MB
g++	random_03	AC	29 ms	4 MB
g++	random_04	AC	94 ms	4 MB
g++	random_05	AC	148 ms	4 MB
g++	random_06	AC	112 ms	4 MB
g++	random_07	AC	18 ms	4 MB
g++	random_08	AC	48 ms	4 MB
g++	random_09	AC	193 ms	4 MB