lmori's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub lmorinn/library

:heavy_check_mark: verify/LibraryChecker/data-structure/union-find/PersistentUnionfind.test.cpp

Depends on

Code

#include "../../../../template/template.hpp"
#define PROBLEM "https://judge.yosupo.jp/problem/persistent_unionfind"
#include "../../../../data-structure/union-find/PersistentUnionFind.hpp"
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    in(n, q);
    PersistentUnionfind uf(n);
    vector<PersistentUnionfind::Node *> g(q + 1);
    g[0] = uf.get_root();

    rep(i, q) {
        int t, k, u, v;
        in(t, k, u, v);
        k++;
        if (t == 0) {
            g[i + 1] = uf.merge(g[k], u, v);
        } else {
            out(uf.same(g[k], u, v));
        }
    }
}
#line 2 "template/template.hpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ull = unsigned long long;
using ld = long double;
using int128 = __int128_t;
#define all(x) (x).begin(), (x).end()
#define uniqv(v) v.erase(unique(all(v)), v.end())
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define logfixed(x) cout << fixed << setprecision(10) << x << endl;

ostream &operator<<(ostream &dest, __int128_t value) {
  ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(ios_base::badbit);
    }
  }
  return dest;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != (int)v.size() ? " " : "");
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const unordered_map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
  os << pair_var.first << " " << pair_var.second;
  return os;
}

void out() { cout << '\n'; }
template <class T, class... Ts>
void out(const T &a, const Ts &...b) {
  cout << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

void outf() { cout << '\n'; }
template <class T, class... Ts>
void outf(const T &a, const Ts &...b) {
  cout << fixed << setprecision(14) << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
  cin >> first;
  in(rest...);
  return;
}

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

vector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};
vector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<lint> dx4 = {1, 0, -1, 0};
vector<lint> dy4 = {0, 1, 0, -1};

#pragma endregion
#line 2 "verify/LibraryChecker/data-structure/union-find/PersistentUnionfind.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/persistent_unionfind"
#line 1 "data-structure/others/PersistentArray.hpp"

template <class T>
class PersistentArray {
 public:
  struct Node {
    Node *l, *r;
    T val;
    Node() : l(nullptr), r(nullptr) {
    }
  };
  PersistentArray() {}
  PersistentArray(int siz) {
    n = siz;
    vector<T> v(n);
    root = new Node();
    for (int i = 0; i < n; i++) {
      init_set(root, i, v[i], 0, n);
    }
  }

  PersistentArray(int siz, T x) {
    n = siz;
    root = new Node();
    for (int i = 0; i < n; i++) {
      init_set(root, i, x, 0, n);
    }
  }

  PersistentArray(const vector<T> &v) {
    n = int(v.size());
    root = new Node();
    for (int i = 0; i < n; i++) {
      init_set(root, i, v[i], 0, n);
    }
  }

  T get(Node *ptr, int p) {
    return get(ptr, p, 0, n)->val;
  }

  Node *get_root() {
    return root;
  }

  Node *set(Node *ptr, int p, T x) {
    Node *new_root = new Node();
    Node *cur = new_root;
    int l = 0;
    int r = n;
    while (r - l > 1) {
      int m = (l + r) >> 1;
      if (l <= p and p < m) {
        if (!cur->l) cur->l = new Node();
        cur->r = ptr->r;
        cur = cur->l;
        ptr = ptr->l;
        r = m;
      } else {
        if (!cur->r) cur->r = new Node();
        cur->l = ptr->l;
        cur = cur->r;
        ptr = ptr->r;
        l = m;
      }
    }
    cur->val = x;
    return new_root;
  }

 private:
  int n;

  Node *root;

  void init_set(Node *cur, int p, T x, int l, int r) {
    while (r - l > 1) {
      int m = (l + r) >> 1;
      if (l <= p and p < m) {
        if (!cur->l) cur->l = new Node();
        cur = cur->l;
        r = m;
      } else {
        if (!cur->r) cur->r = new Node();
        cur = cur->r;
        l = m;
      }
    }
    cur->val = x;
  }

  Node *get(Node *cur, int p, int l, int r) {
    while (r - l > 1) {
      int m = (l + r) >> 1;
      if (l <= p and p < m) {
        cur = cur->l;
        r = m;
      } else {
        cur = cur->r;
        l = m;
      }
    }
    return cur;
  }
};
#line 2 "data-structure/union-find/PersistentUnionFind.hpp"

struct PersistentUnionfind {
 public:
  using Node = PersistentArray<int>::Node;
  PersistentUnionfind() : _n(0) {}
  explicit PersistentUnionfind(int n) : _n(n), parent_or_size(n, -1) {
    root = parent_or_size.get_root();
  }

  Node *get_root() {
    return root;
  }

  Node *merge(Node *p, int a, int b) {
    assert(0 <= a && a < _n);
    assert(0 <= b && b < _n);
    int x = leader(p, a), y = leader(p, b);
    if (x == y) return p;
    int px = parent_or_size.get(p, x);
    int py = parent_or_size.get(p, y);
    if (-px < -py) std::swap(x, y);
    // Node *ret = parent_or_size.set(p, x, px + py);
    return parent_or_size.set(parent_or_size.set(p, x, px + py), y, x);
  }

  bool same(Node *p, int a, int b) {
    assert(0 <= a && a < _n);
    assert(0 <= b && b < _n);
    return leader(p, a) == leader(p, b);
  }

  int leader(Node *p, int a) {
    assert(0 <= a && a < _n);
    if (parent_or_size.get(p, a) < 0) return a;
    return leader(p, parent_or_size.get(p, a));
  }

  int size(Node *p, int a) {
    assert(0 <= a && a < _n);
    return -parent_or_size.get(p, leader(p, a));
  }

  std::vector<std::vector<int>> groups(Node *p) {
    std::vector<int> leader_buf(_n), group_size(_n);
    for (int i = 0; i < _n; i++) {
      leader_buf[i] = leader(p, i);
      group_size[leader_buf[i]]++;
    }
    std::vector<std::vector<int>> result(_n);
    for (int i = 0; i < _n; i++) {
      result[i].reserve(group_size[i]);
    }
    for (int i = 0; i < _n; i++) {
      result[leader_buf[i]].push_back(i);
    }
    result.erase(
        std::remove_if(result.begin(), result.end(),
                       [&](const std::vector<int> &v) { return v.empty(); }),
        result.end());
    return result;
  }

 private:
  int _n;
  // root node: -1 * component size
  // otherwise: parent

  PersistentArray<int> parent_or_size;
  Node *root;
};
#line 4 "verify/LibraryChecker/data-structure/union-find/PersistentUnionfind.test.cpp"
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    in(n, q);
    PersistentUnionfind uf(n);
    vector<PersistentUnionfind::Node *> g(q + 1);
    g[0] = uf.get_root();

    rep(i, q) {
        int t, k, u, v;
        in(t, k, u, v);
        k++;
        if (t == 0) {
            g[i + 1] = uf.merge(g[k], u, v);
        } else {
            out(uf.same(g[k], u, v));
        }
    }
}
Back to top page