Tifa's CP Library

:heavy_check_mark: segtree (src/code/ds/segtree.hpp)

Depends on

Required by

Verified with

Code

#ifndef TIFALIBS_DS_SEGTREE
#define TIFALIBS_DS_SEGTREE

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

namespace tifa_libs::ds {
namespace segtree_impl_ {
template <bool use_tag, class T, auto op, auto e, class F, auto mapping, auto composition, auto id>
requires requires(T val, T val_l, T val_r, F tag) {
  { e() } -> std::same_as<T>;
  { op(val_l, val_r) } -> std::same_as<T>;
  { id() } -> std::same_as<F>;
  { mapping(tag, val) } -> std::same_as<T>;
}
class segtree {
  vec<T> t;
  vec<F> sign;
  vecb set_sign;
  u32 n;

 public:
  explicit constexpr segtree(vec<T> const &a) : t(a.size() * 4), sign(), set_sign(), n((u32)a.size()) {
    if constexpr (use_tag) sign.resize(t.size()), set_sign.resize(t.size());
    build(a, 1, 0, n - 1);
  }
  explicit constexpr segtree(u32 N = 0) : t(N * 4), sign(), set_sign(), n(N) {
    if constexpr (use_tag) sign.resize(t.size()), set_sign.resize(t.size());
    if (n) build(vec<T>(n, e()), 1, 0, n - 1);
  }

  constexpr void update(u32 L, u32 R, F f) { update(1, 0, n - 1, L, R, f); }
  constexpr void update(u32 pos, F f) { update(1, 0, n - 1, pos, pos, f); }
  constexpr void set(u32 L, u32 R, T f) { set(1, 0, n - 1, L, R, f); }
  constexpr void set(u32 pos, T f) { set(1, 0, n - 1, pos, pos, f); }
  constexpr T query(u32 L, u32 R) { return query(1, 0, n - 1, L, R); }
  constexpr T query(u32 pos) { return query(1, 0, n - 1, pos, pos); }

 private:
  constexpr void pushup(u32 x) { t[x] = op(t[x * 2], t[x * 2 + 1]); }
  constexpr void all_update(u32 x, F f) {
    t[x] = mapping(f, t[x]);
    if constexpr (use_tag) sign[x] = composition(f, sign[x]);
  }
  constexpr void all_set(u32 x, T f) {
    t[x] = f;
    if constexpr (use_tag) sign[x] = id(), set_sign[x] = 1;
  }
  constexpr void pushdown(u32 x) {
    if constexpr (use_tag) {
      if (set_sign[x]) all_set(x * 2, t[x]), all_set(x * 2 + 1, t[x]), set_sign[x] = 0;
      else all_update(x * 2, sign[x]), all_update(x * 2 + 1, sign[x]), sign[x] = id();
    }
  }
  constexpr void build(vec<T> const &a, u32 x, u32 l, u32 r) {
    if constexpr (use_tag) sign[x] = id();
    if (l == r) return void(t[x] = a[l]);
    u32 mid = l + (r - l) / 2;
    build(a, x * 2, l, mid), build(a, x * 2 + 1, mid + 1, r);
    pushup(x);
  }
  constexpr void update(u32 x, u32 l, u32 r, u32 L, u32 R, F f) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return void(all_update(x, f));
    pushdown(x);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) update(x * 2, l, mid, L, R, f);
    if (R > mid) update(x * 2 + 1, mid + 1, r, L, R, f);
    pushup(x);
  }
  constexpr void set(u32 x, u32 l, u32 r, u32 L, u32 R, T f) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return void(all_set(x, f));
    pushdown(x);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) set(x * 2, l, mid, L, R, f);
    if (R > mid) set(x * 2 + 1, mid + 1, r, L, R, f);
    pushup(x);
  }
  constexpr T query(u32 x, u32 l, u32 r, u32 L, u32 R) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return t[x];
    pushdown(x);
    u32 mid = l + (r - l) / 2;
    T ret = e();
    if (L <= mid) ret = op(ret, query(x * 2, l, mid, L, R));
    if (R > mid) ret = op(ret, query(x * 2 + 1, mid + 1, r, L, R));
    return ret;
  }
};
}  // namespace segtree_impl_

template <class T, auto op, auto e, class F, auto mapping, auto composition, auto id>
requires requires(F tag_l, F tag_r) {
  { composition(tag_l, tag_r) } -> std::same_as<F>;
}
using segtree = segtree_impl_::segtree<true, T, op, e, F, mapping, composition, id>;
template <class T, auto op, auto e>
using segtree_notag = segtree_impl_::segtree<false, T, op, e, T, op, op, e>;

}  // namespace tifa_libs::ds

#endif
#line 1 "src/code/ds/segtree.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/segtree.hpp"

namespace tifa_libs::ds {
namespace segtree_impl_ {
template <bool use_tag, class T, auto op, auto e, class F, auto mapping, auto composition, auto id>
requires requires(T val, T val_l, T val_r, F tag) {
  { e() } -> std::same_as<T>;
  { op(val_l, val_r) } -> std::same_as<T>;
  { id() } -> std::same_as<F>;
  { mapping(tag, val) } -> std::same_as<T>;
}
class segtree {
  vec<T> t;
  vec<F> sign;
  vecb set_sign;
  u32 n;

 public:
  explicit constexpr segtree(vec<T> const &a) : t(a.size() * 4), sign(), set_sign(), n((u32)a.size()) {
    if constexpr (use_tag) sign.resize(t.size()), set_sign.resize(t.size());
    build(a, 1, 0, n - 1);
  }
  explicit constexpr segtree(u32 N = 0) : t(N * 4), sign(), set_sign(), n(N) {
    if constexpr (use_tag) sign.resize(t.size()), set_sign.resize(t.size());
    if (n) build(vec<T>(n, e()), 1, 0, n - 1);
  }

  constexpr void update(u32 L, u32 R, F f) { update(1, 0, n - 1, L, R, f); }
  constexpr void update(u32 pos, F f) { update(1, 0, n - 1, pos, pos, f); }
  constexpr void set(u32 L, u32 R, T f) { set(1, 0, n - 1, L, R, f); }
  constexpr void set(u32 pos, T f) { set(1, 0, n - 1, pos, pos, f); }
  constexpr T query(u32 L, u32 R) { return query(1, 0, n - 1, L, R); }
  constexpr T query(u32 pos) { return query(1, 0, n - 1, pos, pos); }

 private:
  constexpr void pushup(u32 x) { t[x] = op(t[x * 2], t[x * 2 + 1]); }
  constexpr void all_update(u32 x, F f) {
    t[x] = mapping(f, t[x]);
    if constexpr (use_tag) sign[x] = composition(f, sign[x]);
  }
  constexpr void all_set(u32 x, T f) {
    t[x] = f;
    if constexpr (use_tag) sign[x] = id(), set_sign[x] = 1;
  }
  constexpr void pushdown(u32 x) {
    if constexpr (use_tag) {
      if (set_sign[x]) all_set(x * 2, t[x]), all_set(x * 2 + 1, t[x]), set_sign[x] = 0;
      else all_update(x * 2, sign[x]), all_update(x * 2 + 1, sign[x]), sign[x] = id();
    }
  }
  constexpr void build(vec<T> const &a, u32 x, u32 l, u32 r) {
    if constexpr (use_tag) sign[x] = id();
    if (l == r) return void(t[x] = a[l]);
    u32 mid = l + (r - l) / 2;
    build(a, x * 2, l, mid), build(a, x * 2 + 1, mid + 1, r);
    pushup(x);
  }
  constexpr void update(u32 x, u32 l, u32 r, u32 L, u32 R, F f) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return void(all_update(x, f));
    pushdown(x);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) update(x * 2, l, mid, L, R, f);
    if (R > mid) update(x * 2 + 1, mid + 1, r, L, R, f);
    pushup(x);
  }
  constexpr void set(u32 x, u32 l, u32 r, u32 L, u32 R, T f) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return void(all_set(x, f));
    pushdown(x);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) set(x * 2, l, mid, L, R, f);
    if (R > mid) set(x * 2 + 1, mid + 1, r, L, R, f);
    pushup(x);
  }
  constexpr T query(u32 x, u32 l, u32 r, u32 L, u32 R) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return t[x];
    pushdown(x);
    u32 mid = l + (r - l) / 2;
    T ret = e();
    if (L <= mid) ret = op(ret, query(x * 2, l, mid, L, R));
    if (R > mid) ret = op(ret, query(x * 2 + 1, mid + 1, r, L, R));
    return ret;
  }
};
}  // namespace segtree_impl_

template <class T, auto op, auto e, class F, auto mapping, auto composition, auto id>
requires requires(F tag_l, F tag_r) {
  { composition(tag_l, tag_r) } -> std::same_as<F>;
}
using segtree = segtree_impl_::segtree<true, T, op, e, F, mapping, composition, id>;
template <class T, auto op, auto e>
using segtree_notag = segtree_impl_::segtree<false, T, op, e, T, op, op, e>;

}  // namespace tifa_libs::ds


Back to top page