Tifa's CP Library

:warning: odt (src/code/util/odt.hpp)

Depends on

Code

#ifndef TIFALIBS_UTIL_ODT
#define TIFALIBS_UTIL_ODT

#include "util.hpp"

namespace tifa_libs {

template <class T>
class ODT {
  //! [l, r]
  struct YYZ {
    u32 l, r;
    mutable T v;
    //! [l, r]
    constexpr YYZ(u32 l, u32 r, T const &v) : l(l), r(r), v(v) {}
    constexpr auto operator<=>(YYZ const &o) const { return (i32)l - (i32)o.l; }
  };

  std::set<YYZ> data;

 public:
  explicit constexpr ODT() : data() {}
  explicit constexpr ODT(vec<T> const &c) : ODT() {
    u32 cnt = 0;
    for (auto &&i : c) {
      data.emplace(cnt, cnt, i);
      ++cnt;
    }
  }

  constexpr void clear() { data.clear(); }
  //! [l, r]
  constexpr void insert(u32 l, u32 r, T const &v) { data.emplace(l, r, v); }
  constexpr auto find(u32 x) const { return std::prev(data.upper_bound(YYZ{x, 0, 0})); }
  constexpr auto split(u32 x) {
    auto it = find(x);
    if (it->l == x) return it;
    auto [l, r, v] = *it;
    data.erase(it), data.emplace(l, x - 1, v);
    return data.emplace(x, r, v).first;
  }
  //! [l, r]
  constexpr void assign(u32 l, u32 r, T const &v) {
    auto itr = split(r + 1), itl = split(l);
    data.erase(itl, itr), data.emplace(l, r, v);
  }
  //! [l, r]
  // merge adjacent nodes with same value
  constexpr void assign_merge(u32 l, u32 r, T const &v) {
    auto itl = find(l), itr = find(r);
    if (itr != data.end()) {
      if (itr != std::prev(data.end()) && itr->r == r && (++itr)->v == v) r = (itr++)->r;
      else if (itr->v != v) itr = split(r + 1), itl = find(l);
      else r = (itr++)->r;
    }
    if (itl != data.begin() && itr->l == l && std::prev(itl)->v == v) l = (--itl)->l;
    else if (itl->v != v) itl = split(l);
    else l = itl->l;
    data.erase(itl, itr), data.emplace(l, r, v);
  }
  //! [l, r]
  // @param f: (iter) -> void
  template <class F>
  constexpr void run(u32 l, u32 r, F f) {
    for (auto itr = split(r + 1), itl = split(l); itl != itr; ++itl) f(itl);
  }
  //! [l, r]
  // @param f: (iter_l, iter_r) -> auto
  template <class F>
  constexpr auto run_no_split(u32 l, u32 r, F f) const { return f(find(l), find(r)); }
};

}  // namespace tifa_libs

#endif
#line 1 "src/code/util/odt.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&&...) {};
inline const auto fn_is0 = [](auto x) { return x == 0; };


#line 5 "src/code/util/odt.hpp"

namespace tifa_libs {

template <class T>
class ODT {
  //! [l, r]
  struct YYZ {
    u32 l, r;
    mutable T v;
    //! [l, r]
    constexpr YYZ(u32 l, u32 r, T const &v) : l(l), r(r), v(v) {}
    constexpr auto operator<=>(YYZ const &o) const { return (i32)l - (i32)o.l; }
  };

  std::set<YYZ> data;

 public:
  explicit constexpr ODT() : data() {}
  explicit constexpr ODT(vec<T> const &c) : ODT() {
    u32 cnt = 0;
    for (auto &&i : c) {
      data.emplace(cnt, cnt, i);
      ++cnt;
    }
  }

  constexpr void clear() { data.clear(); }
  //! [l, r]
  constexpr void insert(u32 l, u32 r, T const &v) { data.emplace(l, r, v); }
  constexpr auto find(u32 x) const { return std::prev(data.upper_bound(YYZ{x, 0, 0})); }
  constexpr auto split(u32 x) {
    auto it = find(x);
    if (it->l == x) return it;
    auto [l, r, v] = *it;
    data.erase(it), data.emplace(l, x - 1, v);
    return data.emplace(x, r, v).first;
  }
  //! [l, r]
  constexpr void assign(u32 l, u32 r, T const &v) {
    auto itr = split(r + 1), itl = split(l);
    data.erase(itl, itr), data.emplace(l, r, v);
  }
  //! [l, r]
  // merge adjacent nodes with same value
  constexpr void assign_merge(u32 l, u32 r, T const &v) {
    auto itl = find(l), itr = find(r);
    if (itr != data.end()) {
      if (itr != std::prev(data.end()) && itr->r == r && (++itr)->v == v) r = (itr++)->r;
      else if (itr->v != v) itr = split(r + 1), itl = find(l);
      else r = (itr++)->r;
    }
    if (itl != data.begin() && itr->l == l && std::prev(itl)->v == v) l = (--itl)->l;
    else if (itl->v != v) itl = split(l);
    else l = itl->l;
    data.erase(itl, itr), data.emplace(l, r, v);
  }
  //! [l, r]
  // @param f: (iter) -> void
  template <class F>
  constexpr void run(u32 l, u32 r, F f) {
    for (auto itr = split(r + 1), itl = split(l); itl != itr; ++itl) f(itl);
  }
  //! [l, r]
  // @param f: (iter_l, iter_r) -> auto
  template <class F>
  constexpr auto run_no_split(u32 l, u32 r, F f) const { return f(find(l), find(r)); }
};

}  // namespace tifa_libs


Back to top page