Tifa's CP Library

:warning: leftist_tree (src/code/ds/leftist_tree.hpp)

Depends on

Code

#ifndef TIFALIBS_DS_LEFTIST_TREE
#define TIFALIBS_DS_LEFTIST_TREE

#include "../util/util.hpp"

namespace tifa_libs::ds {

template <class T>
class leftist_tree {
  u32 cnt;
  struct YYZ {
    u32 l, r;
    arr<u32, 2> son{};
    u32 dist, rt;
    T w;
    bool del;
    constexpr YYZ() {}
    constexpr YYZ(u32 l, u32 r, u32 dist_, u32 rt_, T w_, bool del_ = false) : l(l), r(r), dist(dist_), rt(rt_), w(w_), del(del_) {}
  };

  constexpr u32 merge_(u32 x, u32 y) {
    if (x == -1u) return y;
    if (y == -1u) return x;
    if (t[y].w < t[x].w || (t[y].w == t[x].w && x > y)) std::swap(x, y);
    t[x].r = merge_(t[x].r, y);
    if (t[x].l == -1_u32 || t[t[x].r].dist > t[t[x].l].dist) std::swap(t[x].l, t[x].r);
    t[x].dist = (t[x].r == -1u ? 0 : t[t[x].r].dist + 1);
    return x;
  }
  void del(u32 x) {
    t[x].del = true;
    t[x].rt = merge_(t[x].l, t[x].r);
    if (t[x].l != -1u) t[t[x].l].rt = t[x].rt;
    if (t[x].r != -1u) t[t[x].r].rt = t[x].rt;
  }

 public:
  vec<YYZ> t;

  constexpr explicit leftist_tree(vec<T> const& a) : t() {
    for (auto x : a) newheap(x);
  }
  constexpr explicit leftist_tree() : t() {}

  void newheap(T w) {
    t.emplace_back(-1u, -1u, 0, t.size(), w, false);
  }
  u32 gf(u32 x) { return t[x].rt == x ? x : t[x].rt = gf(t[x].rt); }
  bool same(u32 x, u32 y) {
    if (t[x].del || t[y].del) return false;
    if ((x = gf(x)) == (y = gf(y))) return false;
    return true;
  }
  void merge(u32 x, u32 y) {
    if (t[x].del || t[y].del) return;
    if ((x = gf(x)) == (y = gf(y))) return;
    t[x].rt = t[y].rt = merge_(x, y);
  }
  T pop(u32 x) {
    if (t[x].del) return std::numeric_limits<T>::max();
    T ret = t[x = gf(x)].w;
    del(x);
    return ret;
  }
};

}  // namespace tifa_libs::ds

#endif
#line 1 "src/code/ds/leftist_tree.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/ds/leftist_tree.hpp"

namespace tifa_libs::ds {

template <class T>
class leftist_tree {
  u32 cnt;
  struct YYZ {
    u32 l, r;
    arr<u32, 2> son{};
    u32 dist, rt;
    T w;
    bool del;
    constexpr YYZ() {}
    constexpr YYZ(u32 l, u32 r, u32 dist_, u32 rt_, T w_, bool del_ = false) : l(l), r(r), dist(dist_), rt(rt_), w(w_), del(del_) {}
  };

  constexpr u32 merge_(u32 x, u32 y) {
    if (x == -1u) return y;
    if (y == -1u) return x;
    if (t[y].w < t[x].w || (t[y].w == t[x].w && x > y)) std::swap(x, y);
    t[x].r = merge_(t[x].r, y);
    if (t[x].l == -1_u32 || t[t[x].r].dist > t[t[x].l].dist) std::swap(t[x].l, t[x].r);
    t[x].dist = (t[x].r == -1u ? 0 : t[t[x].r].dist + 1);
    return x;
  }
  void del(u32 x) {
    t[x].del = true;
    t[x].rt = merge_(t[x].l, t[x].r);
    if (t[x].l != -1u) t[t[x].l].rt = t[x].rt;
    if (t[x].r != -1u) t[t[x].r].rt = t[x].rt;
  }

 public:
  vec<YYZ> t;

  constexpr explicit leftist_tree(vec<T> const& a) : t() {
    for (auto x : a) newheap(x);
  }
  constexpr explicit leftist_tree() : t() {}

  void newheap(T w) {
    t.emplace_back(-1u, -1u, 0, t.size(), w, false);
  }
  u32 gf(u32 x) { return t[x].rt == x ? x : t[x].rt = gf(t[x].rt); }
  bool same(u32 x, u32 y) {
    if (t[x].del || t[y].del) return false;
    if ((x = gf(x)) == (y = gf(y))) return false;
    return true;
  }
  void merge(u32 x, u32 y) {
    if (t[x].del || t[y].del) return;
    if ((x = gf(x)) == (y = gf(y))) return;
    t[x].rt = t[y].rt = merge_(x, y);
  }
  T pop(u32 x) {
    if (t[x].del) return std::numeric_limits<T>::max();
    T ret = t[x = gf(x)].w;
    del(x);
    return ret;
  }
};

}  // namespace tifa_libs::ds


Back to top page