compro_library
This documentation is automatically generated by online-judge-tools/verification-helper
test/library-checker/data-structure/range-chmin-chmax-add-range-sum.test.cpp
- View this file on GitHub
- Last update: 2025-12-27 20:01:42+09:00
- Problem: https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum
Depends on
Code
#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"
#include "../../../template/template.cpp"
#include "../../../data-structure/segtree/segtree-beats.hpp"
const ll inf = 1LL << 61;
struct MonoidAct {
struct S {
ll sum;
int len;
ll mn;
ll mn2;
int mn_cnt;
ll mx;
ll mx2;
int mx_cnt;
bool fail;
};
struct F {
// f(x) = min(ub, max(x + geta, lb))
ll lb;
ll ub;
ll geta;
};
using value_type_S = S;
using value_type_F = F;
static S op(const S &a, const S &b) {
ll sum = a.sum + b.sum;
int len = a.len + b.len;
ll mn = min(a.mn, b.mn);
ll mn2 = (a.mn == b.mn ? min(a.mn2, b.mn2) : a.mn2 <= b.mn ? a.mn2 : b.mn2 <= a.mn ? b.mn2 : max(a.mn, b.mn));
int mn_cnt = a.mn_cnt * (a.mn <= b.mn) + b.mn_cnt * (b.mn <= a.mn);
ll mx = max(a.mx, b.mx);
ll mx2 = (a.mx == b.mx ? max(a.mx2, b.mx2) : a.mx2 >= b.mx ? a.mx2 : b.mx2 >= a.mx ? b.mx2 : min(a.mx, b.mx));
int mx_cnt = a.mx_cnt * (a.mx >= b.mx) + b.mx_cnt * (b.mx >= a.mx);
return {sum, len, mn, mn2, mn_cnt, mx, mx2, mx_cnt, false};
}
static S e() {
return {0, 0, inf, inf, 0, -inf, -inf, 0, false};
}
static S mapping(const F& f, S x) {
if (x.len == 0) return e();
if (x.mn == x.mx or f.lb == f.ub or f.lb >= x.mx or f.ub <= x.mn) {
ll val = min(max(x.mn, f.lb), f.ub) + f.geta;
int len = x.len;
return {val * len, len, val, inf, len, val, -inf, len, false};
} else if (x.mn2 == x.mx) {
x.mn = x.mx2 = max(x.mn, f.lb) + f.geta;
x.mx = x.mn2 = min(x.mx, f.ub) + f.geta;
x.sum = x.mn * x.mn_cnt + x.mx * x.mx_cnt;
return x;
} else if (f.lb < x.mn2 and f.ub > x.mx2) {
ll mn = max(x.mn, f.lb);
ll mx = min(x.mx, f.ub);
x.sum += (mn - x.mn) * x.mn_cnt + (mx - x.mx) * x.mx_cnt + f.geta * x.len;
x.mn = mn + f.geta;
x.mx = mx + f.geta;
x.mn2 += f.geta;
x.mx2 += f.geta;
return x;
}
x.fail = true;
return x;
}
static F composition(const F& f, const F& g) {
if (f.lb == -inf and f.ub == inf and f.geta == 0) return g;
ll geta = f.geta + g.geta;
ll lb = max(min(g.lb + g.geta, f.ub), f.lb) - g.geta;
ll ub = min(max(g.ub + g.geta, f.lb), f.ub) - g.geta;
return {lb, ub, geta};
}
static F id() { return {-inf, inf, 0}; }
};
int main() {
INT(N, Q);
vector<MonoidAct::S> iv(N);
REP(i, N) {
LL(a);
iv[i] = {a, 1, a, inf, 1, a, -inf, 1, false};
}
SegtreeBeats<MonoidAct> seg(iv);
REP(_, Q) {
INT(t);
if (t == 3) {
INT(l, r);
print(seg.prod(l, r).sum);
} else {
INT(l, r);
LL(b);
if (t == 0) {
seg.apply(l, r, {-inf, b, 0});
} else if (t == 1) {
seg.apply(l, r, {b, inf, 0});
} else {
seg.apply(l, r, {-inf, inf, b});
}
}
}
}#line 1 "test/library-checker/data-structure/range-chmin-chmax-add-range-sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"
#line 1 "template/template.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// input output utils
namespace siro53_io {
// https://maspypy.github.io/library/other/io_old.hpp
struct has_val_impl {
template <class T>
static auto check(T &&x) -> decltype(x.val(), std::true_type{});
template <class T> static auto check(...) -> std::false_type;
};
template <class T>
class has_val : public decltype(has_val_impl::check<T>(std::declval<T>())) {
};
// debug
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void dump(const T t) {
cerr << t;
}
template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
void dump(const T t) {
cerr << t;
}
template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
void dump(const T &t) {
cerr << t.val();
}
void dump(__int128_t n) {
if(n == 0) {
cerr << '0';
return;
} else if(n < 0) {
cerr << '-';
n = -n;
}
string s;
while(n > 0) {
s += (char)('0' + n % 10);
n /= 10;
}
reverse(s.begin(), s.end());
cerr << s;
}
void dump(const string &s) { cerr << s; }
void dump(const char *s) {
int n = (int)strlen(s);
for(int i = 0; i < n; i++) cerr << s[i];
}
template <class T1, class T2> void dump(const pair<T1, T2> &p) {
cerr << '(';
dump(p.first);
cerr << ',';
dump(p.second);
cerr << ')';
}
template <class T> void dump(const vector<T> &v) {
cerr << '{';
for(int i = 0; i < (int)v.size(); i++) {
dump(v[i]);
if(i < (int)v.size() - 1) cerr << ',';
}
cerr << '}';
}
template <class T> void dump(const set<T> &s) {
cerr << '{';
for(auto it = s.begin(); it != s.end(); it++) {
dump(*it);
if(next(it) != s.end()) cerr << ',';
}
cerr << '}';
}
template <class Key, class Value> void dump(const map<Key, Value> &mp) {
cerr << '{';
for(auto it = mp.begin(); it != mp.end(); it++) {
dump(*it);
if(next(it) != mp.end()) cerr << ',';
}
cerr << '}';
}
template <class Key, class Value>
void dump(const unordered_map<Key, Value> &mp) {
cerr << '{';
for(auto it = mp.begin(); it != mp.end(); it++) {
dump(*it);
if(next(it) != mp.end()) cerr << ',';
}
cerr << '}';
}
template <class T> void dump(const deque<T> &v) {
cerr << '{';
for(int i = 0; i < (int)v.size(); i++) {
dump(v[i]);
if(i < (int)v.size() - 1) cerr << ',';
}
cerr << '}';
}
template <class T> void dump(queue<T> q) {
cerr << '{';
while(!q.empty()) {
dump(q.front());
if((int)q.size() > 1) cerr << ',';
q.pop();
}
cerr << '}';
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail>
void debug_print(const Head &h, const Tail &...t) {
dump(h);
if(sizeof...(Tail)) dump(' ');
debug_print(t...);
}
// print
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void print_single(const T t) {
cout << t;
}
template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
void print_single(const T t) {
cout << t;
}
template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
void print_single(const T t) {
cout << t.val();
}
void print_single(__int128_t n) {
if(n == 0) {
cout << '0';
return;
} else if(n < 0) {
cout << '-';
n = -n;
}
string s;
while(n > 0) {
s += (char)('0' + n % 10);
n /= 10;
}
reverse(s.begin(), s.end());
cout << s;
}
void print_single(const string &s) { cout << s; }
void print_single(const char *s) {
int n = (int)strlen(s);
for(int i = 0; i < n; i++) cout << s[i];
}
template <class T1, class T2> void print_single(const pair<T1, T2> &p) {
print_single(p.first);
cout << ' ';
print_single(p.second);
}
template <class T> void print_single(const vector<T> &v) {
for(int i = 0; i < (int)v.size(); i++) {
print_single(v[i]);
if(i < (int)v.size() - 1) cout << ' ';
}
}
template <class T> void print_single(const set<T> &s) {
for(auto it = s.begin(); it != s.end(); it++) {
print_single(*it);
if(next(it) != s.end()) cout << ' ';
}
}
template <class T> void print_single(const deque<T> &v) {
for(int i = 0; i < (int)v.size(); i++) {
print_single(v[i]);
if(i < (int)v.size() - 1) cout << ' ';
}
}
template <class T> void print_single(queue<T> q) {
while(!q.empty()) {
print_single(q.front());
if((int)q.size() > 1) cout << ' ';
q.pop();
}
}
void print() { cout << '\n'; }
template <class Head, class... Tail>
void print(const Head &h, const Tail &...t) {
print_single(h);
if(sizeof...(Tail)) print_single(' ');
print(t...);
}
// input
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void input_single(T &t) {
cin >> t;
}
template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
void input_single(T &t) {
cin >> t;
}
template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
void input_single(T &t) {
cin >> t;
}
void input_single(__int128_t &n) {
string s;
cin >> s;
if(s == "0") {
n = 0;
return;
}
bool is_minus = false;
if(s[0] == '-') {
s = s.substr(1);
is_minus = true;
}
n = 0;
for(int i = 0; i < (int)s.size(); i++) n = n * 10 + (int)(s[i] - '0');
if(is_minus) n = -n;
}
void input_single(string &s) { cin >> s; }
template <class T1, class T2> void input_single(pair<T1, T2> &p) {
input_single(p.first);
input_single(p.second);
}
template <class T> void input_single(vector<T> &v) {
for(auto &e : v) input_single(e);
}
void input() {}
template <class Head, class... Tail> void input(Head &h, Tail &...t) {
input_single(h);
input(t...);
}
}; // namespace siro53_io
#ifdef DEBUG
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debug_print(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
// io setup
struct Setup {
Setup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __Setup;
using namespace siro53_io;
// types
using ll = long long;
using i128 = __int128_t;
// input macros
#define INT(...) \
int __VA_ARGS__; \
input(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
input(__VA_ARGS__)
#define STRING(...) \
string __VA_ARGS__; \
input(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
input(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
input(__VA_ARGS__)
#define LD(...) \
long double __VA_ARGS__; \
input(__VA_ARGS__)
#define UINT(...) \
unsigned int __VA_ARGS__; \
input(__VA_ARGS__)
#define ULL(...) \
unsigned long long __VA_ARGS__; \
input(__VA_ARGS__)
#define VEC(name, type, len) \
vector<type> name(len); \
input(name);
#define VEC2(name, type, len1, len2) \
vector name(len1, vector<type>(len2)); \
input(name);
// other macros
// https://trap.jp/post/1224/
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define UNIQUE(v) \
sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end()), v.shrink_to_fit()
#define REV(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
#define MIN(v) (*min_element(ALL(v)))
#define MAX(v) (*max_element(ALL(v)))
// util const
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// util functions
void Case(int i) { cout << "Case #" << i << ": "; }
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
template <class T> inline bool chmax(T &a, T b) {
return (a < b ? a = b, true : false);
}
template <class T> inline bool chmin(T &a, T b) {
return (a > b ? a = b, true : false);
}
template <class T, int dim>
auto make_vector_impl(vector<int>& sizes, const T &e) {
if constexpr(dim == 1) {
return vector(sizes[0], e);
} else {
int n = sizes[dim - 1];
sizes.pop_back();
return vector(n, make_vector_impl<T, dim - 1>(sizes, e));
}
}
template <class T, int dim>
auto make_vector(const int (&sizes)[dim], const T &e = T()) {
vector<int> s(dim);
for(int i = 0; i < dim; i++) s[i] = sizes[dim - i - 1];
return make_vector_impl<T, dim>(s, e);
}
vector<int> iota_gen(int n, int start = 0) {
vector<int> ord(n);
iota(ord.begin(), ord.end(), start);
return ord;
}
template<typename T>
vector<int> ord_sort(const vector<T>& v, bool greater = false) {
auto ord = iota_gen((int)v.size());
sort(ALL(ord), [&](int i, int j) {
if(greater) return v[i] > v[j];
return v[i] < v[j];
});
return ord;
}
#pragma endregion Macros
#line 2 "data-structure/segtree/segtree-beats.hpp"
#line 5 "data-structure/segtree/segtree-beats.hpp"
template<class MonoidAct> class SegtreeBeats {
public:
using S = typename MonoidAct::value_type_S;
using F = typename MonoidAct::value_type_F;
SegtreeBeats(): SegtreeBeats(0) {}
explicit SegtreeBeats(int n): SegtreeBeats(std::vector<S>(n, MonoidAct::e())) {}
explicit SegtreeBeats(const std::vector<S> &v): N((int)v.size()), sz(1), lg(0) {
while(sz < N) {
sz <<= 1;
lg++;
}
node.resize(sz * 2, MonoidAct::e());
lazy.resize(sz, MonoidAct::id());
for(int i = 0; i < N; i++) node[i + sz] = v[i];
for(int i = sz - 1; i >= 1; i--) update(i);
}
void set(int pos, S val) {
assert(0 <= pos && pos < N);
pos += sz;
for(int i = lg; i >= 1; i--) propagate(pos >> i);
node[pos] = val;
for(int i = 1; i <= lg; i++) update(pos >> i);
}
S get(int pos) {
assert(0 <= pos and pos < N);
pos += sz;
for(int i = lg; i >= 1; i--) propagate(pos >> i);
return node[pos];
}
S prod(int l, int r) {
assert(0 <= l and l <= r and r <= N);
if (l == r) return MonoidAct::e();
l += sz;
r += sz;
for(int i = lg; i >= 1; i--) {
if (((l >> i) << i) != l) propagate(l >> i);
if (((r >> i) << i) != r) propagate((r - 1) >> i);
}
S vl = MonoidAct::e(), vr = MonoidAct::e();
while(l < r) {
if (l & 1) vl = MonoidAct::op(vl, node[l++]);
if (r & 1) vr = MonoidAct::op(node[--r], vr);
l >>= 1;
r >>= 1;
}
return MonoidAct::op(vl, vr);
}
S all_prod() const { return node[1]; }
void apply(int pos, F f) {
assert(0 <= pos and pos < N);
pos += sz;
for(int i = lg; i >= 1; i--) propagate(pos >> i);
node[pos] = MonoidAct::mapping(f, node[pos]);
for(int i = 1; i <= lg; i++) update(pos >> i);
}
void apply(int l, int r, F f) {
assert(0 <= l and l <= r and r <= N);
if (l == r) return;
l += sz;
r += sz;
for(int i = lg; i >= 1; i--) {
if (((l >> i) << i) != l) propagate(l >> i);
if (((r >> i) << i) != r) propagate((r - 1) >> i);
}
{
int tmp_l = l, tmp_r = r;
while(l < r) {
if (l & 1) apply_node(l++, f);
if (r & 1) apply_node(--r, f);
l >>= 1;
r >>= 1;
}
l = tmp_l, r = tmp_r;
}
for(int i = 1; i <= lg; i++) {
if (((l >> i) << i) != l) update(l >> i);
if (((r >> i) << i) != r) update((r - 1) >> i);
}
}
template <class G> int max_right(int l, G g) {
assert(0 <= l and l <= N);
assert(g(MonoidAct::e()));
if (l == N) return N;
l += sz;
for(int i = lg; i >= 1; i--) propagate(l >> i);
S now = MonoidAct::e();
do {
while ((l & 1) == 0) l >>= 1;
if (!g(MonoidAct::op(now, node[l]))) {
while (l < sz) {
propagate(l);
l <<= 1;
if (g(MonoidAct::op(now, node[l]))) {
now = MonoidAct::op(now, node[l]);
l++;
}
}
return l - sz;
}
now = MonoidAct::op(now, node[l]);
} while ((l & -l) != l);
return N;
}
template <class G> int min_left(int r, G g) {
assert(0 <= r and r <= N);
assert(g(MonoidAct::e()));
if (r == 0) return 0;
r += sz;
for(int i = lg; i >= 1; i--) propagate((r - 1) >> i);
S now = MonoidAct::e();
do {
r--;
while (r > 1 and (r & 1) == 0) r >>= 1;
if (!g(MonoidAct::op(node[r], now))) {
while (r < sz) {
propagate(r);
r = (r << 1) + 1;
if (g(MonoidAct::op(node[r], now))) {
now = MonoidAct::op(node[r], now);
r--;
}
}
return r + 1 - sz;
}
now = MonoidAct::op(node[r], now);
} while((r & -r) != r);
return 0;
}
private:
int N, sz, lg;
std::vector<S> node;
std::vector<F> lazy;
void update(int i) {
node[i] = MonoidAct::op(node[i << 1], node[(i << 1) | 1]);
}
void apply_node(int i, F f) {
node[i] = MonoidAct::mapping(f, node[i]);
if (i < sz) {
lazy[i] = MonoidAct::composition(f, lazy[i]);
if (node[i].fail) {
propagate(i);
update(i);
}
}
}
void propagate(int i) {
apply_node(i << 1, lazy[i]);
apply_node(i << 1 | 1, lazy[i]);
lazy[i] = MonoidAct::id();
}
};
#line 4 "test/library-checker/data-structure/range-chmin-chmax-add-range-sum.test.cpp"
const ll inf = 1LL << 61;
struct MonoidAct {
struct S {
ll sum;
int len;
ll mn;
ll mn2;
int mn_cnt;
ll mx;
ll mx2;
int mx_cnt;
bool fail;
};
struct F {
// f(x) = min(ub, max(x + geta, lb))
ll lb;
ll ub;
ll geta;
};
using value_type_S = S;
using value_type_F = F;
static S op(const S &a, const S &b) {
ll sum = a.sum + b.sum;
int len = a.len + b.len;
ll mn = min(a.mn, b.mn);
ll mn2 = (a.mn == b.mn ? min(a.mn2, b.mn2) : a.mn2 <= b.mn ? a.mn2 : b.mn2 <= a.mn ? b.mn2 : max(a.mn, b.mn));
int mn_cnt = a.mn_cnt * (a.mn <= b.mn) + b.mn_cnt * (b.mn <= a.mn);
ll mx = max(a.mx, b.mx);
ll mx2 = (a.mx == b.mx ? max(a.mx2, b.mx2) : a.mx2 >= b.mx ? a.mx2 : b.mx2 >= a.mx ? b.mx2 : min(a.mx, b.mx));
int mx_cnt = a.mx_cnt * (a.mx >= b.mx) + b.mx_cnt * (b.mx >= a.mx);
return {sum, len, mn, mn2, mn_cnt, mx, mx2, mx_cnt, false};
}
static S e() {
return {0, 0, inf, inf, 0, -inf, -inf, 0, false};
}
static S mapping(const F& f, S x) {
if (x.len == 0) return e();
if (x.mn == x.mx or f.lb == f.ub or f.lb >= x.mx or f.ub <= x.mn) {
ll val = min(max(x.mn, f.lb), f.ub) + f.geta;
int len = x.len;
return {val * len, len, val, inf, len, val, -inf, len, false};
} else if (x.mn2 == x.mx) {
x.mn = x.mx2 = max(x.mn, f.lb) + f.geta;
x.mx = x.mn2 = min(x.mx, f.ub) + f.geta;
x.sum = x.mn * x.mn_cnt + x.mx * x.mx_cnt;
return x;
} else if (f.lb < x.mn2 and f.ub > x.mx2) {
ll mn = max(x.mn, f.lb);
ll mx = min(x.mx, f.ub);
x.sum += (mn - x.mn) * x.mn_cnt + (mx - x.mx) * x.mx_cnt + f.geta * x.len;
x.mn = mn + f.geta;
x.mx = mx + f.geta;
x.mn2 += f.geta;
x.mx2 += f.geta;
return x;
}
x.fail = true;
return x;
}
static F composition(const F& f, const F& g) {
if (f.lb == -inf and f.ub == inf and f.geta == 0) return g;
ll geta = f.geta + g.geta;
ll lb = max(min(g.lb + g.geta, f.ub), f.lb) - g.geta;
ll ub = min(max(g.ub + g.geta, f.lb), f.ub) - g.geta;
return {lb, ub, geta};
}
static F id() { return {-inf, inf, 0}; }
};
int main() {
INT(N, Q);
vector<MonoidAct::S> iv(N);
REP(i, N) {
LL(a);
iv[i] = {a, 1, a, inf, 1, a, -inf, 1, false};
}
SegtreeBeats<MonoidAct> seg(iv);
REP(_, Q) {
INT(t);
if (t == 3) {
INT(l, r);
print(seg.prod(l, r).sum);
} else {
INT(l, r);
LL(b);
if (t == 0) {
seg.apply(l, r, {-inf, b, 0});
} else if (t == 1) {
seg.apply(l, r, {b, inf, 0});
} else {
seg.apply(l, r, {-inf, inf, b});
}
}
}
}