library
This documentation is automatically generated by online-judge-tools/verification-helper
Verify/LC_range_chmin_chmax_add_range_sum.test.cpp
- View this file on GitHub
- Last update: 2024-04-26 03:32:16+09:00
- Problem: https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum
Depends on
- Segment Tree Beats
(DataStructure/segtreebeats.hpp)
- Template/template.hpp
- Fast IO
(Utility/fastio.hpp)
Code
#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"
#include "Template/template.hpp"
#include "Utility/fastio.hpp"
#include "DataStructure/segtreebeats.hpp"
int main(){
int n,q;
read(n,q);
vector<ll> a(n);
read(a);
Segtreebeats seg(a);
int t,L,R;
ll x;
while(q--){
read(t);
if(t==0){
read(L,R,x);
seg.range_chmin(L,R,x);
}
if(t==1){
read(L,R,x);
seg.range_chmax(L,R,x);
}
if(t==2){
read(L,R,x);
seg.range_add(L,R,x);
}
if(t==3){
read(L,R);
print(seg.query_sum(L,R));
}
}
return 0;
}#line 1 "Verify/LC_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.hpp"
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b-1); i >= (int)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
assert(y != 0);
if (y < 0)
x = -x, y = -y;
return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
assert(y != 0);
if (y < 0)
x = -x, y = -y;
return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
return (x == 0 ? -1 : __builtin_ctzll(x));
}
#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
for (; a[i] != ',' && a[i] != '\0'; i++)
cerr << a[i];
cerr << ":" << b << " ";
_show(i + 1, a, c...);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "P(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T, template <class> class C>
ostream &operator<<(ostream &os, const C<T> &v) {
os << "[";
for (auto d : v)
os << d << ", ";
os << "]";
return os;
}
#line 2 "Utility/fastio.hpp"
#include <unistd.h>
namespace fastio {
static constexpr uint32_t SZ = 1 << 17;
char ibuf[SZ];
char obuf[SZ];
char out[100];
// pointer of ibuf, obuf
uint32_t pil = 0, pir = 0, por = 0;
struct Pre {
char num[10000][4];
constexpr Pre() : num() {
for (int i = 0; i < 10000; i++) {
int n = i;
for (int j = 3; j >= 0; j--) {
num[i][j] = n % 10 | '0';
n /= 10;
}
}
}
} constexpr pre;
inline void load() {
memmove(ibuf, ibuf + pil, pir - pil);
pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
pil = 0;
if (pir < SZ)
ibuf[pir++] = '\n';
}
inline void flush() {
fwrite(obuf, 1, por, stdout);
por = 0;
}
void rd(char &c) {
do {
if (pil + 1 > pir)
load();
c = ibuf[pil++];
} while (isspace(c));
}
void rd(string &x) {
x.clear();
char c;
do {
if (pil + 1 > pir)
load();
c = ibuf[pil++];
} while (isspace(c));
do {
x += c;
if (pil == pir)
load();
c = ibuf[pil++];
} while (!isspace(c));
}
template <typename T> void rd_real(T &x) {
string s;
rd(s);
x = stod(s);
}
template <typename T> void rd_integer(T &x) {
if (pil + 100 > pir)
load();
char c;
do
c = ibuf[pil++];
while (c < '-');
bool minus = 0;
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (c == '-') {
minus = 1, c = ibuf[pil++];
}
}
x = 0;
while ('0' <= c) {
x = x * 10 + (c & 15), c = ibuf[pil++];
}
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (minus)
x = -x;
}
}
void rd(int &x) {
rd_integer(x);
}
void rd(ll &x) {
rd_integer(x);
}
void rd(i128 &x) {
rd_integer(x);
}
void rd(uint &x) {
rd_integer(x);
}
void rd(ull &x) {
rd_integer(x);
}
void rd(u128 &x) {
rd_integer(x);
}
void rd(double &x) {
rd_real(x);
}
void rd(long double &x) {
rd_real(x);
}
template <class T, class U> void rd(pair<T, U> &p) {
return rd(p.first), rd(p.second);
}
template <size_t N = 0, typename T> void rd_tuple(T &t) {
if constexpr (N < std::tuple_size<T>::value) {
auto &x = std::get<N>(t);
rd(x);
rd_tuple<N + 1>(t);
}
}
template <class... T> void rd(tuple<T...> &tpl) {
rd_tuple(tpl);
}
template <size_t N = 0, typename T> void rd(array<T, N> &x) {
for (auto &d : x)
rd(d);
}
template <class T> void rd(vector<T> &x) {
for (auto &d : x)
rd(d);
}
void read() {}
template <class H, class... T> void read(H &h, T &...t) {
rd(h), read(t...);
}
void wt(const char c) {
if (por == SZ)
flush();
obuf[por++] = c;
}
void wt(const string s) {
for (char c : s)
wt(c);
}
void wt(const char *s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++)
wt(s[i]);
}
template <typename T> void wt_integer(T x) {
if (por > SZ - 100)
flush();
if (x < 0) {
obuf[por++] = '-', x = -x;
}
int outi;
for (outi = 96; x >= 10000; outi -= 4) {
memcpy(out + outi, pre.num[x % 10000], 4);
x /= 10000;
}
if (x >= 1000) {
memcpy(obuf + por, pre.num[x], 4);
por += 4;
} else if (x >= 100) {
memcpy(obuf + por, pre.num[x] + 1, 3);
por += 3;
} else if (x >= 10) {
int q = (x * 103) >> 10;
obuf[por] = q | '0';
obuf[por + 1] = (x - q * 10) | '0';
por += 2;
} else
obuf[por++] = x | '0';
memcpy(obuf + por, out + outi + 4, 96 - outi);
por += 96 - outi;
}
template <typename T> void wt_real(T x) {
ostringstream oss;
oss << fixed << setprecision(15) << double(x);
string s = oss.str();
wt(s);
}
void wt(int x) {
wt_integer(x);
}
void wt(ll x) {
wt_integer(x);
}
void wt(i128 x) {
wt_integer(x);
}
void wt(uint x) {
wt_integer(x);
}
void wt(ull x) {
wt_integer(x);
}
void wt(u128 x) {
wt_integer(x);
}
void wt(double x) {
wt_real(x);
}
void wt(long double x) {
wt_real(x);
}
template <class T, class U> void wt(const pair<T, U> val) {
wt(val.first);
wt(' ');
wt(val.second);
}
template <size_t N = 0, typename T> void wt_tuple(const T t) {
if constexpr (N < std::tuple_size<T>::value) {
if constexpr (N > 0) {
wt(' ');
}
const auto x = std::get<N>(t);
wt(x);
wt_tuple<N + 1>(t);
}
}
template <class... T> void wt(tuple<T...> tpl) {
wt_tuple(tpl);
}
template <class T, size_t S> void wt(const array<T, S> val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i)
wt(' ');
wt(val[i]);
}
}
template <class T> void wt(const vector<T> val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i)
wt(' ');
wt(val[i]);
}
}
void print() {
wt('\n');
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
wt(head);
if (sizeof...(Tail))
wt(' ');
print(forward<Tail>(tail)...);
}
void __attribute__((destructor)) _d() {
flush();
}
} // namespace fastio
using fastio::flush;
using fastio::print;
using fastio::read;
inline void first(bool i = true) {
print(i ? "first" : "second");
}
inline void Alice(bool i = true) {
print(i ? "Alice" : "Bob");
}
inline void yes(bool i = true) {
print(i ? "yes" : "no");
}
inline void Yes(bool i = true) {
print(i ? "Yes" : "No");
}
inline void No() {
print("No");
}
inline void YES(bool i = true) {
print(i ? "YES" : "NO");
}
inline void NO() {
print("NO");
}
inline void Yay(bool i = true) {
print(i ? "Yay!" : ":(");
}
inline void Possible(bool i = true) {
print(i ? "Possible" : "Impossible");
}
inline void POSSIBLE(bool i = true) {
print(i ? "POSSIBLE" : "IMPOSSIBLE");
}
/**
* @brief Fast IO
*/
#line 2 "DataStructure/segtreebeats.hpp"
struct Segtreebeats{
struct state{
ll maxx=-INF,smax=-INF,cmax=0,lmax=-INF;
ll minn=INF,smin=INF,cmin=0,lmin=INF;
ll sum=0,add=0; int len=1;
state(){}
state(ll val):maxx(val),cmax(1),minn(val),cmin(1),sum(val){}
};
int n; vector<state> val;
Segtreebeats(int _n):Segtreebeats(vector<ll>(_n,0)){}
Segtreebeats(const vector<ll>& a){
for(n=1;n<(int)a.size();n<<=1);
val.assign(2*n,state());
rep(i,0,a.size())val[i+n]=state(a[i]);
for(int i=n-1;i;i--)apply(i);
}
void apply(int k){
state &x=val[k],&lb=val[2*k],&rb=val[2*k+1];
if(lb.minn<rb.minn)x.minn=lb.minn,x.cmin=lb.cmin,x.smin=min(lb.smin,rb.minn);
else if(lb.minn>rb.minn)x.minn=rb.minn,x.cmin=rb.cmin,x.smin=min(rb.smin,lb.minn);
else x.minn=lb.minn,x.cmin=lb.cmin+rb.cmin,x.smin=min(lb.smin,rb.smin);
if(lb.maxx>rb.maxx)x.maxx=lb.maxx,x.cmax=lb.cmax,x.smax=max(lb.smax,rb.maxx);
else if(lb.maxx<rb.maxx)x.maxx=rb.maxx,x.cmax=rb.cmax,x.smax=max(rb.smax,lb.maxx);
else x.maxx=lb.maxx,x.cmax=lb.cmax+rb.cmax,x.smax=max(lb.smax,rb.smax);
x.len=lb.len+rb.len; x.sum=lb.sum+rb.sum;
}
void eval(int k){
state &x=val[k],&lb=(k<n?val[2*k]:val[0]),&rb=(k<n?val[2*k+1]:val[0]);
if(x.add){
if(lb.lmax!=-INF)lb.lmax+=x.add;
if(lb.lmin!=INF)lb.lmin+=x.add;
if(rb.lmax!=-INF)rb.lmax+=x.add;
if(rb.lmin!=INF)rb.lmin+=x.add;
lb.add+=x.add; rb.add+=x.add;
x.minn+=x.add;
if(x.smin!=INF)x.smin+=x.add;
x.maxx+=x.add;
if(x.smax!=-INF)x.smax+=x.add;
x.sum+=x.len*x.add; x.add=0;
}
if(x.lmax!=-INF){
chmax(lb.lmax,x.lmax);
chmax(lb.lmin,x.lmax);
chmax(rb.lmax,x.lmax);
chmax(rb.lmin,x.lmax);
if(x.lmax>=x.smin){eval(k*2); eval(k*2+1); apply(k);}
else if(x.lmax>x.minn){
x.sum+=x.cmin*(x.lmax-x.minn);
if(x.smax==x.minn)x.smax=x.lmax;
if(x.maxx==x.minn)x.maxx=x.lmax;
x.minn=x.lmax;
} x.lmax=-INF;
}
if(x.lmin!=INF){
chmin(lb.lmax,x.lmin);
chmin(lb.lmin,x.lmin);
chmin(rb.lmax,x.lmin);
chmin(rb.lmin,x.lmin);
if(x.lmin<=x.smax){eval(k*2); eval(k*2+1); apply(k);}
else if(x.lmin<x.maxx){
x.sum+=x.cmax*(x.lmin-x.maxx);
if(x.smin==x.maxx)x.smin=x.lmin;
if(x.minn==x.maxx)x.minn=x.lmin;
x.maxx=x.lmin;
} x.lmin=INF;
}
}
void range_add(int a,int b,ll c,int k=1,int l=0,int r=-1){
if(r<0)r=n; eval(k);
if(b<=l||a>=r)return;
if(b>=r&&a<=l){
val[k].add=c; eval(k);
}else{
range_add(a,b,c,k*2,l,(l+r)/2);
range_add(a,b,c,k*2+1,(l+r)/2,r);
apply(k);
}
}
void range_chmin(int a,int b,ll c,int k=1,int l=0,int r=-1){
if(r<0)r=n; eval(k);
if(b<=l||a>=r)return;
if(b>=r&&a<=l){
val[k].lmin=c; eval(k);
}else{
range_chmin(a,b,c,k*2,l,(l+r)/2);
range_chmin(a,b,c,k*2+1,(l+r)/2,r);
apply(k);
}
}
void range_chmax(int a,int b,ll c,int k=1,int l=0,int r=-1){
if(r<0)r=n; eval(k);
if(b<=l||a>=r)return;
if(b>=r&&a<=l){
val[k].lmax=c; eval(k);
}else{
range_chmax(a,b,c,k*2,l,(l+r)/2);
range_chmax(a,b,c,k*2+1,(l+r)/2,r);
apply(k);
}
}
ll query_max(int a,int b,int k=1,int l=0,int r=-1){
if(r<0)r=n; eval(k);
if(b<=l||a>=r)return -INF;
if(b>=r&&a<=l)return val[k].maxx;
else{
ll res=max(query_max(a,b,k*2,l,(l+r)/2),query_max(a,b,k*2+1,(l+r)/2,r));
return res;
}
}
ll query_min(int a,int b,int k=1,int l=0,int r=-1){
if(r<0)r=n; eval(k);
if(b<=l||a>=r)return INF;
if(b>=r&&a<=l)return val[k].minn;
else{
ll res=min(query_min(a,b,k*2,l,(l+r)/2),query_min(a,b,k*2+1,(l+r)/2,r));
return res;
}
}
ll query_sum(int a,int b,int k=1,int l=0,int r=-1){
if(r<0)r=n; eval(k);
if(b<=l||a>=r)return 0;
if(b>=r&&a<=l)return val[k].sum;
else{
ll res=query_sum(a,b,k*2,l,(l+r)/2)+query_sum(a,b,k*2+1,(l+r)/2,r);
return res;
}
}
};
/**
* @brief Segment Tree Beats
*/
#line 6 "Verify/LC_range_chmin_chmax_add_range_sum.test.cpp"
int main(){
int n,q;
read(n,q);
vector<ll> a(n);
read(a);
Segtreebeats seg(a);
int t,L,R;
ll x;
while(q--){
read(t);
if(t==0){
read(L,R,x);
seg.range_chmin(L,R,x);
}
if(t==1){
read(L,R,x);
seg.range_chmax(L,R,x);
}
if(t==2){
read(L,R,x);
seg.range_add(L,R,x);
}
if(t==3){
read(L,R);
print(seg.query_sum(L,R));
}
}
return 0;
}