Tifa's CP Library

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

Depends on

Verified with

Code

#ifndef TIFALIBS_DS_SEGTREE_OLD
#define TIFALIBS_DS_SEGTREE_OLD

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

namespace tifa_libs::ds {

template <class T, class F>
class segtree_old {
  struct YYZ {
    T w, sign, sign1, _min, _max;
  };
  vec<YYZ> t;

  constexpr void pushup(u32 x) {
    t[x].w = t[x * 2].w + t[x * 2 + 1].w;
    t[x]._min = std::min(t[x * 2]._min, t[x * 2 + 1]._min);
    t[x]._max = std::max(t[x * 2]._max, t[x * 2 + 1]._max);
  }
  constexpr void build(vec<T> const &a, u32 x, u32 l, u32 r) {
    t[x].sign1 = 1;
    if (l == r) return void(t[x].w = 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 pushdown(u32 x, u32 l, u32 r) {  // sign1(*) must be pushdowned before sign(+)
    if (t[x].sign1 != 1) {
      t[x * 2].w *= t[x].sign1;
      t[x * 2].sign *= t[x].sign1, t[x * 2].sign1 *= t[x].sign1;
      t[x * 2]._min *= t[x].sign1, t[x * 2]._max *= t[x].sign1;
      t[x * 2 + 1].w *= t[x].sign1;
      t[x * 2 + 1].sign *= t[x].sign1, t[x * 2 + 1].sign1 *= t[x].sign1;
      t[x * 2 + 1]._min *= t[x].sign1, t[x * 2 + 1]._max *= t[x].sign1;
      t[x].sign1 = 1;
    }
    if (t[x].sign) {
      u32 mid = l + (r - l) / 2;
      t[x * 2].w += i64(mid - l + 1) * t[x].sign, t[x * 2].sign += t[x].sign;
      t[x * 2]._min += t[x].sign, t[x * 2]._max += t[x].sign;
      t[x * 2 + 1].w += i64(r - mid) * t[x].sign, t[x * 2 + 1].sign += t[x].sign;
      t[x * 2 + 1]._min += t[x].sign, t[x * 2 + 1]._max += t[x].sign;
      t[x].sign = 0;
    }
  }

 public:
  explicit constexpr segtree_old(vec<T> const &a) : t(a.size() * 4) { build(a, 1, 0, u32(a.size() - 1)); }

  constexpr void add(u32 x, u32 l, u32 r, u32 L, u32 R, T k) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) {
      t[x].w += i64(r - l + 1) * k, t[x].sign += k;
      t[x]._min += k, t[x]._max += k;
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) add(x * 2, l, mid, L, R, k);
    if (R > mid) add(x * 2 + 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr void mul(u32 x, u32 l, u32 r, u32 L, u32 R, T k) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) {
      t[x].w *= k;
      t[x].sign *= k, t[x].sign1 *= k;
      t[x]._min *= k, t[x]._max *= k;
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) mul(x * 2, l, mid, L, R, k);
    if (R > mid) mul(x * 2 + 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr T querys(u32 x, u32 l, u32 r, u32 L, u32 R) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return t[x].w;
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    T ret = 0;
    if (L <= mid) ret = querys(x * 2, l, mid, L, R);
    if (R > mid) ret += querys(x * 2 + 1, mid + 1, r, L, R);
    return ret;
  }
  constexpr T querym(u32 x, u32 l, u32 r, u32 L, u32 R, F f) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return f(t[x]._min, t[x]._max);
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L > mid) return querym(x * 2 + 1, mid + 1, r, L, R, f);
    if (R <= mid) return querym(x * 2, l, mid, L, R, f);
    return f(querym(x * 2, l, mid, L, R, f), querym(x * 2 + 1, mid + 1, r, L, R, f));
  }
};

}  // namespace tifa_libs::ds

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

namespace tifa_libs::ds {

template <class T, class F>
class segtree_old {
  struct YYZ {
    T w, sign, sign1, _min, _max;
  };
  vec<YYZ> t;

  constexpr void pushup(u32 x) {
    t[x].w = t[x * 2].w + t[x * 2 + 1].w;
    t[x]._min = std::min(t[x * 2]._min, t[x * 2 + 1]._min);
    t[x]._max = std::max(t[x * 2]._max, t[x * 2 + 1]._max);
  }
  constexpr void build(vec<T> const &a, u32 x, u32 l, u32 r) {
    t[x].sign1 = 1;
    if (l == r) return void(t[x].w = 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 pushdown(u32 x, u32 l, u32 r) {  // sign1(*) must be pushdowned before sign(+)
    if (t[x].sign1 != 1) {
      t[x * 2].w *= t[x].sign1;
      t[x * 2].sign *= t[x].sign1, t[x * 2].sign1 *= t[x].sign1;
      t[x * 2]._min *= t[x].sign1, t[x * 2]._max *= t[x].sign1;
      t[x * 2 + 1].w *= t[x].sign1;
      t[x * 2 + 1].sign *= t[x].sign1, t[x * 2 + 1].sign1 *= t[x].sign1;
      t[x * 2 + 1]._min *= t[x].sign1, t[x * 2 + 1]._max *= t[x].sign1;
      t[x].sign1 = 1;
    }
    if (t[x].sign) {
      u32 mid = l + (r - l) / 2;
      t[x * 2].w += i64(mid - l + 1) * t[x].sign, t[x * 2].sign += t[x].sign;
      t[x * 2]._min += t[x].sign, t[x * 2]._max += t[x].sign;
      t[x * 2 + 1].w += i64(r - mid) * t[x].sign, t[x * 2 + 1].sign += t[x].sign;
      t[x * 2 + 1]._min += t[x].sign, t[x * 2 + 1]._max += t[x].sign;
      t[x].sign = 0;
    }
  }

 public:
  explicit constexpr segtree_old(vec<T> const &a) : t(a.size() * 4) { build(a, 1, 0, u32(a.size() - 1)); }

  constexpr void add(u32 x, u32 l, u32 r, u32 L, u32 R, T k) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) {
      t[x].w += i64(r - l + 1) * k, t[x].sign += k;
      t[x]._min += k, t[x]._max += k;
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) add(x * 2, l, mid, L, R, k);
    if (R > mid) add(x * 2 + 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr void mul(u32 x, u32 l, u32 r, u32 L, u32 R, T k) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) {
      t[x].w *= k;
      t[x].sign *= k, t[x].sign1 *= k;
      t[x]._min *= k, t[x]._max *= k;
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) mul(x * 2, l, mid, L, R, k);
    if (R > mid) mul(x * 2 + 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr T querys(u32 x, u32 l, u32 r, u32 L, u32 R) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return t[x].w;
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    T ret = 0;
    if (L <= mid) ret = querys(x * 2, l, mid, L, R);
    if (R > mid) ret += querys(x * 2 + 1, mid + 1, r, L, R);
    return ret;
  }
  constexpr T querym(u32 x, u32 l, u32 r, u32 L, u32 R, F f) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return f(t[x]._min, t[x]._max);
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L > mid) return querym(x * 2 + 1, mid + 1, r, L, R, f);
    if (R <= mid) return querym(x * 2, l, mid, L, R, f);
    return f(querym(x * 2, l, mid, L, R, f), querym(x * 2 + 1, mid + 1, r, L, R, f));
  }
};

}  // namespace tifa_libs::ds


Back to top page