Submit Info #13917

Problem Lang User Status Time Memory
Range Chmin Chmax Add Range Sum cpp Benq AC 835 ms 43.17 MiB

ケース詳細
Name Status Time Memory
example_00 AC 29 ms 40.80 MiB
max_random_00 AC 802 ms 43.11 MiB
max_random_01 AC 826 ms 43.17 MiB
max_random_02 AC 835 ms 43.17 MiB
medium_00 AC 35 ms 40.73 MiB
medium_01 AC 31 ms 40.75 MiB
medium_02 AC 34 ms 40.80 MiB
random_00 AC 559 ms 42.35 MiB
random_01 AC 616 ms 42.48 MiB
random_02 AC 384 ms 41.67 MiB
small_00 AC 32 ms 40.67 MiB
small_01 AC 32 ms 40.67 MiB
small_02 AC 30 ms 40.67 MiB
small_03 AC 23 ms 40.75 MiB
small_04 AC 32 ms 40.67 MiB
small_05 AC 31 ms 40.67 MiB
small_06 AC 27 ms 40.69 MiB
small_07 AC 36 ms 40.77 MiB
small_08 AC 29 ms 40.67 MiB
small_09 AC 32 ms 40.80 MiB

#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef double db; typedef string str; typedef pair<int,int> pi; typedef pair<ll,ll> pl; typedef pair<db,db> pd; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<db> vd; typedef vector<str> vs; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<pd> vpd; #define mp make_pair #define f first #define s second #define sz(x) (int)x.size() #define all(x) begin(x), end(x) #define rall(x) (x).rbegin(), (x).rend() #define rsz resize #define ins insert #define ft front() #define bk back() #define pf push_front #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) const int MOD = 1e9+7; // 998244353; const int MX = 2e5+5; const ll INF = 1e18; const ld PI = acos((ld)-1); const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } constexpr int pct(int x) { return __builtin_popcount(x); } constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) constexpr int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 int fstTrue(function<bool(int)> f, int lo, int hi) { hi ++; assert(lo <= hi); // assuming f is increasing while (lo < hi) { // find first index such that f is true int mid = (lo+hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; } template<class T> void remDup(vector<T>& v) { sort(all(v)); v.erase(unique(all(v)),end(v)); } // INPUT template<class A> void re(complex<A>& c); template<class A, class B> void re(pair<A,B>& p); template<class A> void re(vector<A>& v); template<class A, size_t SZ> void re(array<A,SZ>& a); template<class T> void re(T& x) { cin >> x; } void re(db& d) { str t; re(t); d = stod(t); } void re(ld& d) { str t; re(t); d = stold(t); } template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); } template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; } template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); } template<class A> void re(vector<A>& x) { trav(a,x) re(a); } template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); } // TO_STRING #define ts to_string str ts(char c) { return str(1,c); } str ts(bool b) { return b ? "true" : "false"; } str ts(const char* s) { return (str)s; } str ts(str s) { return s; } template<class A> str ts(complex<A> c) { stringstream ss; ss << c; return ss.str(); } str ts(vector<bool> v) { str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]); res += "}"; return res; } template<size_t SZ> str ts(bitset<SZ> b) { str res = ""; F0R(i,SZ) res += char('0'+b[i]); return res; } template<class A, class B> str ts(pair<A,B> p); template<class T> str ts(T v) { // containers with begin(), end() bool fst = 1; str res = "{"; for (const auto& x: v) { if (!fst) res += ", "; fst = 0; res += ts(x); } res += "}"; return res; } template<class A, class B> str ts(pair<A,B> p) { return "("+ts(p.f)+", "+ts(p.s)+")"; } // OUTPUT template<class A> void pr(A x) { cout << ts(x); } template<class H, class... T> void pr(const H& h, const T&... t) { pr(h); pr(t...); } void ps() { pr("\n"); } // print w/ spaces template<class H, class... T> void ps(const H& h, const T&... t) { pr(h); if (sizeof...(t)) pr(" "); ps(t...); } // DEBUG void DBG() { cerr << "]" << endl; } template<class H, class... T> void DBG(H h, T... t) { cerr << ts(h); if (sizeof...(t)) cerr << ", "; DBG(t...); } #ifdef LOCAL // compile with -DLOCAL #define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__) #else #define dbg(...) 0 #endif // FILE I/O void setIn(string s) { freopen(s.c_str(),"r",stdin); } void setOut(string s) { freopen(s.c_str(),"w",stdout); } void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); } void setIO(string s = "") { unsyncIO(); // cin.exceptions(cin.failbit); // throws exception when do smth illegal // ex. try to read letter into int if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO } typedef pair<pl,int> T; template<int SZ> struct Seg { int N,Q; ll mxMod[2*SZ], mnMod[2*SZ], mod[2*SZ]; T mx[2*SZ], mn[2*SZ]; ll sum[2*SZ]; Seg() { init(); } void init(int ind = 1, int L = 0, int R = SZ-1) { mxMod[ind] = INF, mnMod[ind] = -INF, mod[ind] = 0; // OK if (L == R) { mx[ind] = {{0,-INF},1}; mn[ind] = {{0,INF},1}; sum[ind] = 0; return; } int M = (L+R)/2; init(2*ind,L,M); init(2*ind+1,M+1,R); pull(ind); } T combMn(T a, T b) { // MIN if (a > b) swap(a,b); if (a.f.f == b.f.f) return {{a.f.f,min(a.f.s,b.f.s)},a.s+b.s}; return {{a.f.f,min(a.f.s,b.f.f)},a.s}; } T combMx(T a, T b) { if (a < b) swap(a,b); if (a.f.f == b.f.f) return {{a.f.f,max(a.f.s,b.f.s)},a.s+b.s}; return {{a.f.f,max(a.f.s,b.f.f)},a.s}; } void pull(int ind) { // OK sum[ind] = sum[2*ind]+sum[2*ind+1]; mn[ind] = combMn(mn[2*ind],mn[2*ind+1]); mx[ind] = combMx(mx[2*ind],mx[2*ind+1]); } void push(int ind, int L, int R) { auto chk = [](ll& a, ll b, ll c) { if (a == b) a = c; }; if (mnMod[ind] != -INF) { if (mnMod[ind] > mn[ind].f.f) { assert(mnMod[ind] < mn[ind].f.s); sum[ind] += (mnMod[ind]-mn[ind].f.f)*mn[ind].s; chk(mx[ind].f.f,mn[ind].f.f,mnMod[ind]); chk(mx[ind].f.s,mn[ind].f.f,mnMod[ind]); mn[ind].f.f = mnMod[ind]; if (L != R) F0R(i,2) { int pos = 2*ind+i; ckmax(mnMod[pos],mnMod[ind]-mod[pos]); ckmax(mxMod[pos],mnMod[pos]); } } mnMod[ind] = -INF; } if (mxMod[ind] != INF) { if (mxMod[ind] < mx[ind].f.f) { assert(mxMod[ind] > mx[ind].f.s); sum[ind] += (mxMod[ind]-mx[ind].f.f)*mx[ind].s; chk(mn[ind].f.f,mx[ind].f.f,mxMod[ind]); chk(mn[ind].f.s,mx[ind].f.f,mxMod[ind]); mx[ind].f.f = mxMod[ind]; if (L != R) F0R(i,2) { int pos = 2*ind+i; ckmin(mxMod[pos],mxMod[ind]-mod[pos]); ckmin(mnMod[pos],mxMod[pos]); } } mxMod[ind] = INF; } sum[ind] += mod[ind]*(R-L+1); auto inc = [](T& a, ll b) { if (abs(a.f.f) != INF) a.f.f += b; if (abs(a.f.s) != INF) a.f.s += b; }; inc(mx[ind],mod[ind]); inc(mn[ind],mod[ind]); if (L != R) F0R(i,2) { int pos = 2*ind+i; mod[pos] += mod[ind]; } mod[ind] = 0; } ll query(int lo, int hi, int ind = 1, int L = 0, int R = SZ-1) { push(ind,L,R); if (R < lo || hi < L) return 0; if (lo <= L && R <= hi) { //dbg("???",ind,L,R,sum[ind]); return sum[ind]; } int M = (L+R)/2; return query(lo,hi,2*ind,L,M)+query(lo,hi,2*ind+1,M+1,R); } void upd(int lo, int hi, int t, ll b, int ind = 1, int L = 0, int R = SZ-1) { push(ind,L,R); if (R < lo || hi < L) return; if (t == 0) { if (b >= mx[ind].f.f) return; } else if (t == 1) { if (b <= mn[ind].f.f) return; } if (lo <= L && R <= hi) { if (t == 0) { if (b > mx[ind].f.s) { mxMod[ind] = b; push(ind,L,R); return; } } else if (t == 1) { if (b < mn[ind].f.s) { mnMod[ind] = b; push(ind,L,R); return; } } else if (t == 2) { mod[ind] = b; push(ind,L,R); return; } } assert(L != R); int M = (L+R)/2; upd(lo,hi,t,b,2*ind,L,M); upd(lo,hi,t,b,2*ind+1,M+1,R); pull(ind); } }; Seg<1<<18> S; int main() { setIO(); int N,Q; re(N,Q); vl A(N); re(A); F0R(i,N) S.upd(i,i,2,A[i]); // OK F0R(i,Q) { int t,l,r; re(t,l,r); r --; // dbg("??",i,t,l,r); if (t <= 2) { ll b; re(b); S.upd(l,r,t,b); } else { ps(S.query(l,r)); } // FOR(j,1,4) { // dbg(j,S.mxMod[j],S.mnMod[j],S.mod[j]); // dbg(S.mx[j],S.mn[j],S.sum[j]); // } // ps(); } // you should actually read the stuff at the bottom } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN */