Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/range_chmin_chmax_add_range_sum.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"

#include "../../code/ds/segtree_beats.hpp"
#include "../../code/io/fastio.hpp"

int main() {
  u32 n, q;
  tifa_libs::fin >> n >> q;
  vec<i64> a(n);
  for (auto& x : a) tifa_libs::fin >> x;
  tifa_libs::ds::segtree_beats<i64> seg(a);
  for (u32 i = 0, opt, l, r; i < q; ++i) {
    tifa_libs::fin >> opt >> l >> r;
    --r;
    if (opt == 3) tifa_libs::fout << seg.querys(1, 0, n - 1, l, r) << '\n';
    else {
      i64 b;
      tifa_libs::fin >> b;
      if (opt == 0) seg.chmin(1, 0, n - 1, l, r, b);
      else if (opt == 1) seg.chmax(1, 0, n - 1, l, r, b);
      else seg.add(1, 0, n - 1, l, r, b);
    }
  }
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/range_chmin_chmax_add_range_sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"

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

namespace tifa_libs::ds {

template <class T, class T1 = T>
class segtree_beats {
  struct YYZ {
    T1 sum;
    T _min, secmin, cntmin;
    T _max, secmax, cntmax, hismax;
  };
  struct NFO {
    T add1, add2, add3;  // add sign of min, max and (no min or max)
    T maxadd1, maxadd2, maxadd3;
  };
  u32 n;
  vec<YYZ> t;
  vec<NFO> sign;
  T INF;

 public:
  explicit constexpr segtree_beats(vec<T> const& a) : n(a.size()), t(a.size() * 4), sign(a.size() * 4), INF(std::numeric_limits<T>::max()) { build(a, 1, 0, n - 1); }
  explicit constexpr segtree_beats(u32 N) : n(N), t(N * 4), sign(N * 4), INF(std::numeric_limits<T>::max()) { build(vec<T>(n, 0), 1, 0, n - 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) {
      all_update(x, l, r, k, k, k, k, k, k);
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) add(x << 1, l, mid, L, R, k);
    if (R > mid) add(x << 1 | 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr void chmax(u32 x, u32 l, u32 r, u32 L, u32 R, T k) {
    assert(R >= l && L <= r);
    if (k <= t[x]._min) return;
    if (L <= l && r <= R && k < t[x].secmin) {
      all_update(x, l, r, k - t[x]._min, 0, 0, k - t[x]._min, 0, 0);
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) chmax(x << 1, l, mid, L, R, k);
    if (R > mid) chmax(x << 1 | 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr void chmin(u32 x, u32 l, u32 r, u32 L, u32 R, T k) {
    assert(R >= l && L <= r);
    if (k >= t[x]._max) return;
    if (L <= l && r <= R && k > t[x].secmax) {
      all_update(x, l, r, 0, k - t[x]._max, 0, 0, k - t[x]._max, 0);
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) chmin(x << 1, l, mid, L, R, k);
    if (R > mid) chmin(x << 1 | 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr T1 querys(u32 x, u32 l, u32 r, u32 L, u32 R) {
    assert(R >= l && L <= r);
    if (L <= l && r <= R) return t[x].sum;
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    T1 ret = 0;
    if (L <= mid) ret = querys(x << 1, l, mid, L, R);
    if (R > mid) ret += querys(x << 1 | 1, mid + 1, r, L, R);
    return ret;
  }
  constexpr T querymax(u32 x, u32 l, u32 r, u32 L, u32 R) {
    assert(R >= l && L <= r);
    if (L <= l && r <= R) return t[x]._max;
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    T ret = -INF;
    if (L <= mid) ret = querymax(x << 1, l, mid, L, R);
    if (R > mid) ret = std::max(ret, querymax(x << 1 | 1, mid + 1, r, L, R));
    return ret;
  }
  constexpr T queryhismax(u32 x, u32 l, u32 r, u32 L, u32 R) {
    assert(R >= l && L <= r);
    if (L <= l && r <= R) return t[x].hismax;
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    T ret = -INF;
    if (L <= mid) ret = queryhismax(x << 1, l, mid, L, R);
    if (R > mid) ret = std::max(ret, queryhismax(x << 1 | 1, mid + 1, r, L, R));
    return ret;
  }

 private:
  constexpr void pushup(u32 x) {
    t[x].sum = t[x << 1].sum + t[x << 1 | 1].sum;
    t[x].hismax = std::max(t[x << 1].hismax, t[x << 1 | 1].hismax);
    if (t[x << 1]._min == t[x << 1 | 1]._min) {
      t[x]._min = t[x << 1]._min;
      t[x].secmin = std::min(t[x << 1].secmin, t[x << 1 | 1].secmin);
      t[x].cntmin = t[x << 1].cntmin + t[x << 1 | 1].cntmin;
    } else if (t[x << 1]._min < t[x << 1 | 1]._min) {
      t[x]._min = t[x << 1]._min;
      t[x].secmin = std::min(t[x << 1].secmin, t[x << 1 | 1]._min);
      t[x].cntmin = t[x << 1].cntmin;
    } else {
      t[x]._min = t[x << 1 | 1]._min;
      t[x].secmin = std::min(t[x << 1]._min, t[x << 1 | 1].secmin);
      t[x].cntmin = t[x << 1 | 1].cntmin;
    }
    if (t[x << 1]._max == t[x << 1 | 1]._max) {
      t[x]._max = t[x << 1]._max;
      t[x].secmax = std::max(t[x << 1].secmax, t[x << 1 | 1].secmax);
      t[x].cntmax = t[x << 1].cntmax + t[x << 1 | 1].cntmax;
    } else if (t[x << 1]._max > t[x << 1 | 1]._max) {
      t[x]._max = t[x << 1]._max;
      t[x].secmax = std::max(t[x << 1].secmax, t[x << 1 | 1]._max);
      t[x].cntmax = t[x << 1].cntmax;
    } else {
      t[x]._max = t[x << 1 | 1]._max;
      t[x].secmax = std::max(t[x << 1]._max, t[x << 1 | 1].secmax);
      t[x].cntmax = t[x << 1 | 1].cntmax;
    }
  }
  constexpr void all_update(u32 x, u32 l, u32 r, T add1, T add2, T add3, T maxadd1, T maxadd2, T maxadd3) {
    if (t[x]._min == t[x]._max) {
      if (add1 == add3) add1 = add2;
      else add2 = add1;
      t[x].sum += T1(add1) * t[x].cntmin;
    } else t[x].sum += T1(add1) * t[x].cntmin + T1(add2) * t[x].cntmax + T1(add3) * (T1(r - l + 1) - t[x].cntmin - t[x].cntmax);
    // t[x].hismax = std::max(t[x].hismax, t[x]._min + maxadd1);
    t[x].hismax = std::max(t[x].hismax, t[x]._max + maxadd2);
    sign[x].maxadd1 = std::max(sign[x].maxadd1, sign[x].add1 + maxadd1);
    sign[x].maxadd2 = std::max(sign[x].maxadd2, sign[x].add2 + maxadd2);
    sign[x].maxadd3 = std::max(sign[x].maxadd3, sign[x].add3 + maxadd3);
    if (t[x].secmin == t[x]._max) t[x].secmin += add2;
    else if (t[x].secmin != INF) t[x].secmin += add3;

    if (t[x].secmax == t[x]._min) t[x].secmax += add1;
    else if (t[x].secmax != -INF) t[x].secmax += add3;

    t[x]._min += add1, t[x]._max += add2;
    sign[x].add1 += add1, sign[x].add2 += add2, sign[x].add3 += add3;
  }
  constexpr void pushdown(u32 x, u32 l, u32 r) {
    if (sign[x].add1 || sign[x].add2 || sign[x].add2 || sign[x].maxadd2 || sign[x].maxadd2 || sign[x].maxadd2) {
      u32 mid = l + (r - l) / 2;
      T _min = std::min(t[x << 1]._min, t[x << 1 | 1]._min);
      T _max = std::max(t[x << 1]._max, t[x << 1 | 1]._max);
      if (t[x << 1]._min == _min) {
        if (t[x << 1]._max == _max) all_update(x << 1, l, mid, sign[x].add1, sign[x].add2, sign[x].add3, sign[x].maxadd1, sign[x].maxadd2, sign[x].maxadd3);
        else all_update(x << 1, l, mid, sign[x].add1, sign[x].add3, sign[x].add3, sign[x].maxadd1, sign[x].maxadd3, sign[x].maxadd3);
      } else if (t[x << 1]._max == _max) all_update(x << 1, l, mid, sign[x].add3, sign[x].add2, sign[x].add3, sign[x].maxadd3, sign[x].maxadd2, sign[x].maxadd3);
      else all_update(x << 1, l, mid, sign[x].add3, sign[x].add3, sign[x].add3, sign[x].maxadd3, sign[x].maxadd3, sign[x].maxadd3);

      if (t[x << 1 | 1]._min == _min) {
        if (t[x << 1 | 1]._max == _max) all_update(x << 1 | 1, mid + 1, r, sign[x].add1, sign[x].add2, sign[x].add3, sign[x].maxadd1, sign[x].maxadd2, sign[x].maxadd3);
        else all_update(x << 1 | 1, mid + 1, r, sign[x].add1, sign[x].add3, sign[x].add3, sign[x].maxadd1, sign[x].maxadd3, sign[x].maxadd3);
      } else if (t[x << 1 | 1]._max == _max) all_update(x << 1 | 1, mid + 1, r, sign[x].add3, sign[x].add2, sign[x].add3, sign[x].maxadd3, sign[x].maxadd2, sign[x].maxadd3);
      else all_update(x << 1 | 1, mid + 1, r, sign[x].add3, sign[x].add3, sign[x].add3, sign[x].maxadd3, sign[x].maxadd3, sign[x].maxadd3);

      sign[x] = {0, 0, 0, 0, 0, 0};
    }
  }
  constexpr void build(vec<T> const& a, u32 x, u32 l, u32 r) {
    if (l == r) {
      t[x].hismax = t[x].sum = t[x]._min = t[x]._max = a[l];
      t[x].secmin = INF, t[x].secmax = -INF;
      t[x].cntmin = t[x].cntmax = 1;
      return;
    }
    u32 mid = l + (r - l) / 2;
    build(a, x << 1, l, mid), build(a, x << 1 | 1, mid + 1, r);
    pushup(x);
  }
};

}  // namespace tifa_libs::ds


#line 1 "src/code/io/fastio.hpp"



#line 1 "src/code/fast/u32tostr.hpp"



#line 5 "src/code/fast/u32tostr.hpp"

namespace tifa_libs {

constexpr u32 u32tostr_si16(u64 x, char *s) {
  if (x <= 9) {
    *s = (char)(x | 0x30);
    return 1;
  } else if (x <= 99) {
    u64 low = x;
    u64 ll = ((low * 103) >> 9) & 0x1E;
    low += ll * 3;
    ll = ((low & 0xF0) >> 4) | ((low & 0x0F) << 8);
    *(u16 *)s = (u16)(ll | 0x3030);
    return 2;
  }
  return 0;
}
constexpr u32 u32tostr_si32(u64 x, char *s) {
  u64 low = 0, ll = 0;
  u32 digits = 0;
  if (x <= 99) return u32tostr_si16(x, s);
  low = x;
  digits = (low > 999) ? 4 : 3;
  ll = ((low * 5243) >> 19) & 0xFF;
  low -= ll * 100;
  low = (low << 16) | ll;
  ll = ((low * 103) >> 9) & 0x1E001E;
  low += ll * 3;
  ll = ((low & 0x00F000F0) << 28) | (low & 0x000F000F) << 40;
  ll |= 0x3030303000000000;
  u8 *p = (u8 *)&ll;
  if (digits == 4) *(u32 *)s = *(u32 *)(&p[4]);
  else {
    *(u16 *)s = *(u16 *)(&p[5]);
    *(((u8 *)s) + 2) = p[7];
  }

  return digits;
}

constexpr u32 u32tostr(u64 x, char *s) {
  u64 low = 0, ll = 0;
  u32 digits = 0;
  if (x <= 9999) return u32tostr_si32(x, s);
  if (x < 100000000) {
    if ((low = x) > 999999) digits = (low > 9999999) ? 8 : 7;
    else digits = (low > 99999) ? 6 : 5;
  } else {
    u64 high = (x * 0x55E63B89) >> 57;
    low = x - (high * 100000000);
    digits = u32tostr_si16(high, s);
    digits += 8;
  }

  ll = (low * 109951163) >> 40;
  (low -= ll * 10000) |= ll << 32;
  ll = ((low * 5243) >> 19) & 0x000000FF000000FF;
  low -= ll * 100;
  low = (low << 16) | ll;
  ll = ((low * 103) >> 9) & 0x001E001E001E001E;
  low += ll * 3;
  ll = ((low & 0x00F000F000F000F0) >> 4) | (low & 0x000F000F000F000F) << 8;
  ll = (ll >> 32) | (ll << 32) | 0x3030303030303030;

  if (digits >= 8) memcpy(s + digits - 8, &ll, 8);
  else {
    u32 d = digits;
    char *s1 = s, *pll = &(((char *)&ll)[8 - digits]);
    if (d >= 4) {
      memcpy(s1, pll, 4);
      s1 += 4, pll += 4, d -= 4;
    }
    if (d >= 2) {
      memcpy(s1, pll, 2);
      s1 += 2, pll += 2, d -= 2;
    }
    if (d > 0) *(u8 *)s1 = *(u8 *)pll;
  }
  return digits;
}

}  // namespace tifa_libs


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



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

namespace tifa_libs {

template <class T>
concept iterable_c = requires(T v) {
  { v.begin() } -> std::same_as<typename T::iterator>;
  { v.end() } -> std::same_as<typename T::iterator>;
};

template <class T>
concept container_c = iterable_c<T> && !std::derived_from<T, std::basic_string<typename T::value_type>>;

template <class T>
constexpr bool is_char_v = std::is_same_v<T, char> || std::is_same_v<T, signed char> || std::is_same_v<T, unsigned char>;
template <class T>
concept char_c = is_char_v<T>;

template <class T>
constexpr bool is_s128_v = std::is_same_v<T, __int128_t> || std::is_same_v<T, __int128>;
template <class T>
concept s128_c = is_s128_v<T>;

template <class T>
constexpr bool is_u128_v = std::is_same_v<T, __uint128_t> || std::is_same_v<T, unsigned __int128>;
template <class T>
concept u128_c = is_u128_v<T>;

template <class T>
constexpr bool is_i128_v = is_s128_v<T> || is_u128_v<T>;
template <class T>
concept i128_c = is_u128_v<T>;

template <class T>
constexpr bool is_int_v = std::is_integral_v<T> || is_i128_v<T>;
template <class T>
concept int_c = is_int_v<T>;

template <class T>
constexpr bool is_sint_v = is_s128_v<T> || (is_int_v<T> && std::is_signed_v<T>);
template <class T>
concept sint_c = is_sint_v<T>;

template <class T>
constexpr bool is_uint_v = is_u128_v<T> || (is_int_v<T> && std::is_unsigned_v<T>);
template <class T>
concept uint_c = is_uint_v<T>;

template <class T>
concept mint_c = requires(T x) {
  { x.mod() } -> uint_c;
  { x.val() } -> uint_c;
};

template <class T>
constexpr bool is_arithm_v = std::is_arithmetic_v<T> || is_int_v<T>;
template <class T>
concept arithm_c = is_arithm_v<T>;

template <class T>
struct to_sint : std::make_signed<T> {};
template <>
struct to_sint<u128> {
  using type = u128;
};
template <>
struct to_sint<i128> {
  using type = u128;
};
template <class T>
using to_sint_t = typename to_sint<T>::type;

template <class T>
struct to_uint : std::make_unsigned<T> {};
template <>
struct to_uint<u128> {
  using type = u128;
};
template <>
struct to_uint<i128> {
  using type = u128;
};
template <class T>
using to_uint_t = typename to_uint<T>::type;

}  // namespace tifa_libs


#line 6 "src/code/io/fastio.hpp"

namespace tifa_libs {
namespace fastio_impl_ {
//! UB if EOF occured during reading
template <u32 BUF>
class fastin {
  char bf_[BUF], *now_ = bf_, *end_ = bf_;
  FILE *f_;

 public:
  explicit fastin(FILE *f = stdin) : f_(f) {}

  char get() { return now_ == end_ && (end_ = (now_ = bf_) + fread(bf_, 1, BUF, f_), now_ == end_) ? EOF : *(now_)++; }
  char peek() { return now_ == end_ && (end_ = (now_ = bf_) + fread(bf_, 1, BUF, f_), now_ == end_) ? EOF : *(now_); }
  void rebind(FILE *f) {
    f_ = f;
    now_ = end_ = bf_;
  }

  bool iseof() { return peek() == EOF; }

  template <class T>
  requires(sint_c<T> && !char_c<T>)
  fastin &read(T &n) {
    bool is_neg = false;
    char ch = get();
    while (!isdigit(ch)) {
      is_neg |= ch == '-';
      ch = get();
    }
    n = 0;
    while (isdigit(ch)) {
      (n *= 10) += ch & 15;
      ch = get();
    }
    if (is_neg) n = -n;
    return *this;
  }
  template <class T>
  requires(uint_c<T> && !char_c<T>)
  fastin &read(T &n) {
    char ch = get();
    while (!isdigit(ch)) ch = get();
    n = 0;
    while (isdigit(ch)) {
      (n *= 10) += ch & 15;
      ch = get();
    }
    return *this;
  }
  template <mint_c T>
  fastin &read(T &n) {
    decltype(std::declval<T>().sval()) x;
    read(x);
    n = T(x);
    return *this;
  }
  //! ignore cntrl and space
  template <char_c T>
  fastin &read(T &n) {
    while (!isgraph(n = get()));
    return *this;
  }
  fastin &read(char *n) {
    char *n_ = n;
    while (!isgraph(*n_ = get()));
    while (isgraph(*(++n_) = get()));
    *n_ = '\0';
    return *this;
  }
  fastin &read(strn &n) {
    n.clear();
    char n_;
    while (!isgraph(n_ = get()));
    n.push_back(n_);
    while (isgraph(n_ = get())) n.push_back(n_);
    return *this;
  }
  template <class T, class U>
  fastin &read(std::pair<T, U> &p) { return read(p.first).read(p.second); }
  template <class... Ts>
  fastin &read(std::tuple<Ts...> &p) {
    std::apply([&](Ts &...targs) { ((read(targs)), ...); }, p);
    return *this;
  }
  template <container_c T>
  fastin &read(T &p) {
    if (p.begin() == p.end()) return *this;
    for (auto &i : p) read(i);
    return *this;
  }

  fastin &getline(char *n) {
    char *n_ = n;
    while (!isprint(*n_ = get()));
    while (isprint(*(++n_) = get()));
    *n_ = '\0';
    return *this;
  }
  fastin &getline(strn &n) {
    char n_;
    while (!isprint(n_ = get()));
    n.push_back(n_);
    while (isprint(n_ = get())) n.push_back(n_);
    return *this;
  }

  //! NOT ignore cntrl and space
  template <char_c T>
  fastin &strict_read(T &n) {
    n = get();
    return *this;
  }

  template <class T>
  fastin &operator>>(T &val) { return read(val); }
};
template <u32 BUF, u32 INTBUF>
class fastout {
  char int_bf_[INTBUF], *now_ib_ = int_bf_;

  FILE *f_;
  char *now_, bf_[BUF];
  const char *const end_ = bf_ + BUF;

 public:
  explicit fastout(FILE *file = stdout) : f_(file), now_(bf_) {}

  fastout &operator=(fastout const &r) {
    f_ = r.f_;
    now_ = bf_ + (r.now_ - r.bf_);
    memcpy(bf_, r.bf_, sizeof(*bf_) * (r.now_ - r.bf_));
    return *this;
  }
  fastout(fastout const &r) { *this = r; }

  ~fastout() { flush(); }

  void flush() {
    fwrite(bf_, 1, usz(now_ - bf_), f_);
    now_ = bf_;
  }
  void rebind(FILE *file) { f_ = file; }

  template <char_c T>
  fastout &write(T const &n) {
    if (now_ == end_) flush();
    *(now_++) = n;
    return *this;
  }
  fastout &write(const char *n) {
    usz len = strlen(n), l_;
    const char *n_ = n;
    while (now_ + len >= end_) {
      memcpy(now_, n_, l_ = usz(end_ - now_));
      now_ += l_;
      n_ += l_;
      len -= l_;
      flush();
    }
    memcpy(now_, n_, len);
    now_ += len;
    return *this;
  }
  template <class T>
  requires(sint_c<T> && !char_c<T>)
  fastout &write(T n) {
    if (n < 0) {
      write('-');
      n = -n;
    }
    return write(to_uint_t<T>(n));
  }
  template <class T>
  requires(uint_c<T> && !char_c<T>)
  fastout &write(T n) {
    if constexpr (sizeof(T) <= 4) {
      memset(now_ib_ = int_bf_, 0, 11);
      u32tostr(n, now_ib_);
      return write(now_ib_);
    }
    now_ib_ = int_bf_ + INTBUF - 1;
    do {
      *(--(now_ib_)) = char(n % 10) | '0';
    } while (n /= 10);
    return write(now_ib_);
  }
  template <mint_c T>
  fastout &write(T n) { return write(n.val()); }
  fastout &write(strn const &str) { return write(str.c_str()); }
  template <class T, class U>
  fastout &write(std::pair<T, U> const &p) { return write(p.first).space().write(p.second); }
  template <class... Ts>
  fastout &write(std::tuple<Ts...> const &p) {
    std::apply(
        [&](Ts const &...targs) {
          usz n{0};
          ((write(targs).space_if(++n != sizeof...(Ts))), ...);
        },
        p);
    return *this;
  }
  template <container_c T>
  fastout &write(T const &p) {
    if (p.begin() == p.end()) return *this;
    auto it = p.begin();
    write(*it++);
    for (; it != p.end(); ++it) space().write(*it);
    return *this;
  }

  fastout &linebreak() { return write('\n'); }
  fastout &linebreak_if(bool flag) { return flag ? linebreak() : *this; }
  fastout &space() { return write(' '); }
  fastout &space_if(bool flag) { return flag ? space() : *this; }

  template <class T>
  fastout &operator<<(T const &val) { return write(val); }
};
}  // namespace fastio_impl_

inline fastio_impl_::fastin<0x200005> fin;
inline fastio_impl_::fastout<0x200005, 41> fout;

}  // namespace tifa_libs


#line 5 "src/test_cpverifier/library-checker/range_chmin_chmax_add_range_sum.test.cpp"

int main() {
  u32 n, q;
  tifa_libs::fin >> n >> q;
  vec<i64> a(n);
  for (auto& x : a) tifa_libs::fin >> x;
  tifa_libs::ds::segtree_beats<i64> seg(a);
  for (u32 i = 0, opt, l, r; i < q; ++i) {
    tifa_libs::fin >> opt >> l >> r;
    --r;
    if (opt == 3) tifa_libs::fout << seg.querys(1, 0, n - 1, l, r) << '\n';
    else {
      i64 b;
      tifa_libs::fin >> b;
      if (opt == 0) seg.chmin(1, 0, n - 1, l, r, b);
      else if (opt == 1) seg.chmax(1, 0, n - 1, l, r, b);
      else seg.add(1, 0, n - 1, l, r, b);
    }
  }
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 9 ms 6 MB
g++-12 max_random_00 :heavy_check_mark: AC 350 ms 97 MB
g++-12 max_random_01 :heavy_check_mark: AC 360 ms 96 MB
g++-12 max_random_02 :heavy_check_mark: AC 353 ms 96 MB
g++-12 medium_00 :heavy_check_mark: AC 11 ms 6 MB
g++-12 medium_01 :heavy_check_mark: AC 9 ms 6 MB
g++-12 medium_02 :heavy_check_mark: AC 9 ms 6 MB
g++-12 random2_00 :heavy_check_mark: AC 417 ms 96 MB
g++-12 random2_01 :heavy_check_mark: AC 416 ms 96 MB
g++-12 random2_02 :heavy_check_mark: AC 434 ms 96 MB
g++-12 random3_00 :heavy_check_mark: AC 509 ms 96 MB
g++-12 random3_01 :heavy_check_mark: AC 510 ms 96 MB
g++-12 random3_02 :heavy_check_mark: AC 525 ms 96 MB
g++-12 random_00 :heavy_check_mark: AC 234 ms 63 MB
g++-12 random_01 :heavy_check_mark: AC 267 ms 75 MB
g++-12 random_02 :heavy_check_mark: AC 168 ms 31 MB
g++-12 small_00 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_01 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_02 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_03 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_04 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_05 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_06 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_07 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_08 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_09 :heavy_check_mark: AC 9 ms 6 MB
Back to top page