Submit Info #20494

Problem Lang User Status Time Memory
Range Chmin Chmax Add Range Sum cpp tonegawa AC 726 ms 42.87 MiB

ケース詳細
Name Status Time Memory
example_00 AC 24 ms 40.30 MiB
max_random_00 AC 607 ms 42.71 MiB
max_random_01 AC 601 ms 42.67 MiB
max_random_02 AC 621 ms 42.73 MiB
medium_00 AC 26 ms 40.30 MiB
medium_01 AC 28 ms 40.30 MiB
medium_02 AC 25 ms 40.28 MiB
random2_00 AC 636 ms 42.80 MiB
random2_01 AC 641 ms 42.80 MiB
random2_02 AC 609 ms 42.87 MiB
random3_00 AC 712 ms 41.80 MiB
random3_01 AC 726 ms 41.86 MiB
random3_02 AC 704 ms 41.78 MiB
random_00 AC 403 ms 41.97 MiB
random_01 AC 422 ms 42.14 MiB
random_02 AC 272 ms 41.17 MiB
small_00 AC 25 ms 40.29 MiB
small_01 AC 26 ms 40.30 MiB
small_02 AC 25 ms 40.36 MiB
small_03 AC 24 ms 40.31 MiB
small_04 AC 25 ms 40.36 MiB
small_05 AC 25 ms 40.30 MiB
small_06 AC 25 ms 40.30 MiB
small_07 AC 22 ms 40.36 MiB
small_08 AC 25 ms 40.27 MiB
small_09 AC 22 ms 40.30 MiB

#include <iostream> #include <string> #include <vector> #include <array> #include <queue> #include <deque> #include <algorithm> #include <set> #include <map> #include <bitset> #include <cmath> #include <functional> #include <iomanip> #define vll vector<ll> #define vvvl vector<vvl> #define vvl vector<vector<ll>> #define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c)) #define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d))); #define re(c, b) for(ll c=0;c<b;c++) #define all(obj) (obj).begin(), (obj).end() typedef long long int ll; typedef long double ld; using namespace std; #include<algorithm> // Segment Tree Beats // - l<=i<r について、 A_i の値を min(A_i, x) に更新 // - l<=i<r について、 A_i の値を max(A_i, x) に更新 // - l<=i<r の中の A_i の最大値を求める // - l<=i<r の中の A_i の最小値を求める // - l<=i<r の A_i の和を求める // - l<=i<r について、 A_i の値に x を加える // - l<=i<r について、 A_i の値を x に更新 #define N 200001 class SegmentTree { const ll inf = 1e18; int n, n0; ll *max_v = (ll*)malloc(4*N * sizeof(ll)); ll *smax_v = (ll*)malloc(4*N * sizeof(ll)); ll *max_c = (ll*)malloc(4*N * sizeof(ll)); ll *min_v = (ll*)malloc(4*N * sizeof(ll)); ll *smin_v = (ll*)malloc(4*N * sizeof(ll)); ll *min_c = (ll*)malloc(4*N * sizeof(ll)); ll *sum = (ll*)malloc(4*N * sizeof(ll)); ll *len = (ll*)malloc(4*N * sizeof(ll)); ll *ladd = (ll*)malloc(4*N * sizeof(ll)); ll *lval = (ll*)malloc(4*N * sizeof(ll)); void update_node_max(int k, ll x) { sum[k] += (x - max_v[k]) * max_c[k]; if(max_v[k] == min_v[k]) { max_v[k] = min_v[k] = x; } else if(max_v[k] == smin_v[k]) { max_v[k] = smin_v[k] = x; } else { max_v[k] = x; } if(lval[k] != inf && x < lval[k]) { lval[k] = x; } } void update_node_min(int k, ll x) { sum[k] += (x - min_v[k]) * min_c[k]; if(max_v[k] == min_v[k]) { max_v[k] = min_v[k] = x; } else if(smax_v[k] == min_v[k]) { min_v[k] = smax_v[k] = x; } else { min_v[k] = x; } if(lval[k] != inf && lval[k] < x) { lval[k] = x; } } void push(int k) { if(n0-1 <= k) return; if(lval[k] != inf) { updateall(2*k+1, lval[k]); updateall(2*k+2, lval[k]); lval[k] = inf; return; } if(ladd[k] != 0) { addall(2*k+1, ladd[k]); addall(2*k+2, ladd[k]); ladd[k] = 0; } if(max_v[k] < max_v[2*k+1]) { update_node_max(2*k+1, max_v[k]); } if(min_v[2*k+1] < min_v[k]) { update_node_min(2*k+1, min_v[k]); } if(max_v[k] < max_v[2*k+2]) { update_node_max(2*k+2, max_v[k]); } if(min_v[2*k+2] < min_v[k]) { update_node_min(2*k+2, min_v[k]); } } void update(int k) { sum[k] = sum[2*k+1] + sum[2*k+2]; if(max_v[2*k+1] < max_v[2*k+2]) { max_v[k] = max_v[2*k+2]; max_c[k] = max_c[2*k+2]; smax_v[k] = max(max_v[2*k+1], smax_v[2*k+2]); } else if(max_v[2*k+1] > max_v[2*k+2]) { max_v[k] = max_v[2*k+1]; max_c[k] = max_c[2*k+1]; smax_v[k] = max(smax_v[2*k+1], max_v[2*k+2]); } else { max_v[k] = max_v[2*k+1]; max_c[k] = max_c[2*k+1] + max_c[2*k+2]; smax_v[k] = max(smax_v[2*k+1], smax_v[2*k+2]); } if(min_v[2*k+1] < min_v[2*k+2]) { min_v[k] = min_v[2*k+1]; min_c[k] = min_c[2*k+1]; smin_v[k] = min(smin_v[2*k+1], min_v[2*k+2]); } else if(min_v[2*k+1] > min_v[2*k+2]) { min_v[k] = min_v[2*k+2]; min_c[k] = min_c[2*k+2]; smin_v[k] = min(min_v[2*k+1], smin_v[2*k+2]); } else { min_v[k] = min_v[2*k+1]; min_c[k] = min_c[2*k+1] + min_c[2*k+2]; smin_v[k] = min(smin_v[2*k+1], smin_v[2*k+2]); } } void _update_min(ll x, int a, int b, int k, int l, int r) { if(b <= l || r <= a || max_v[k] <= x) { return; } if(a <= l && r <= b && smax_v[k] < x) { update_node_max(k, x); return; } push(k); _update_min(x, a, b, 2*k+1, l, (l+r)/2); _update_min(x, a, b, 2*k+2, (l+r)/2, r); update(k); } void _update_max(ll x, int a, int b, int k, int l, int r) { if(b <= l || r <= a || x <= min_v[k]) { return; } if(a <= l && r <= b && x < smin_v[k]) { update_node_min(k, x); return; } push(k); _update_max(x, a, b, 2*k+1, l, (l+r)/2); _update_max(x, a, b, 2*k+2, (l+r)/2, r); update(k); } void addall(int k, ll x) { max_v[k] += x; if(smax_v[k] != -inf) smax_v[k] += x; min_v[k] += x; if(smin_v[k] != inf) smin_v[k] += x; sum[k] += len[k] * x; if(lval[k] != inf) { lval[k] += x; } else { ladd[k] += x; } } void updateall(int k, ll x) { max_v[k] = x; smax_v[k] = -inf; min_v[k] = x; smin_v[k] = inf; max_c[k] = min_c[k] = len[k]; sum[k] = x * len[k]; lval[k] = x; ladd[k] = 0; } void _add_val(ll x, int a, int b, int k, int l, int r) { if(b <= l || r <= a) { return; } if(a <= l && r <= b) { addall(k, x); return; } push(k); _add_val(x, a, b, 2*k+1, l, (l+r)/2); _add_val(x, a, b, 2*k+2, (l+r)/2, r); update(k); } void _update_val(ll x, int a, int b, int k, int l, int r) { if(b <= l || r <= a) { return; } if(a <= l && r <= b) { updateall(k, x); return; } push(k); _update_val(x, a, b, 2*k+1, l, (l+r)/2); _update_val(x, a, b, 2*k+2, (l+r)/2, r); update(k); } ll _query_max(int a, int b, int k, int l, int r) { if(b <= l || r <= a) { return -inf; } if(a <= l && r <= b) { return max_v[k]; } push(k); ll lv = _query_max(a, b, 2*k+1, l, (l+r)/2); ll rv = _query_max(a, b, 2*k+2, (l+r)/2, r); return max(lv, rv); } ll _query_min(int a, int b, int k, int l, int r) { if(b <= l || r <= a) { return inf; } if(a <= l && r <= b) { return min_v[k]; } push(k); ll lv = _query_min(a, b, 2*k+1, l, (l+r)/2); ll rv = _query_min(a, b, 2*k+2, (l+r)/2, r); return min(lv, rv); } ll _query_sum(int a, int b, int k, int l, int r) { if(b <= l || r <= a) { return 0; } if(a <= l && r <= b) { return sum[k]; } push(k); ll lv = _query_sum(a, b, 2*k+1, l, (l+r)/2); ll rv = _query_sum(a, b, 2*k+2, (l+r)/2, r); return lv + rv; } public: SegmentTree(int n) { SegmentTree(n, nullptr); } SegmentTree(int n, ll *a) : n(n) { n0 = 1; while(n0 < n) n0 <<= 1; for(int i=0; i<2*n0; ++i) ladd[i] = 0, lval[i] = inf; len[0] = n0; for(int i=0; i<n0-1; ++i) len[2*i+1] = len[2*i+2] = (len[i] >> 1); for(int i=0; i<n; ++i) { max_v[n0-1+i] = min_v[n0-1+i] = sum[n0-1+i] = (a != nullptr ? a[i] : 0); smax_v[n0-1+i] = -inf; smin_v[n0-1+i] = inf; max_c[n0-1+i] = min_c[n0-1+i] = 1; } for(int i=n; i<n0; ++i) { max_v[n0-1+i] = smax_v[n0-1+i] = -inf; min_v[n0-1+i] = smin_v[n0-1+i] = inf; max_c[n0-1+i] = min_c[n0-1+i] = 0; } for(int i=n0-2; i>=0; i--) { update(i); } } // range minimize query void update_min(int a, int b, ll x) { _update_min(x, a, b, 0, 0, n0); } // range maximize query void update_max(int a, int b, ll x) { _update_max(x, a, b, 0, 0, n0); } // range add query void add_val(int a, int b, ll x) { _add_val(x, a, b, 0, 0, n0); } // range update query void update_val(int a, int b, ll x) { _update_val(x, a, b, 0, 0, n0); } // range minimum query ll query_max(int a, int b) { return _query_max(a, b, 0, 0, n0); } // range maximum query ll query_min(int a, int b) { return _query_min(a, b, 0, 0, n0); } // range sum query ll query_sum(int a, int b) { return _query_sum(a, b, 0, 0, n0); } }; int main(){ ll n, q;scanf("%lld %lld", &n, &q); ll *a = (ll*)malloc(1000000 * sizeof(ll)); re(i, n) scanf("%lld", &a[i]); SegmentTree seg(200001, a); for(int i=0;i<q;i++){ ll x, y, z, v;scanf("%lld %lld %lld", &x, &y, &z); if(x==3){ ll ans = seg.query_sum(y, z); printf("%lld\n", ans); }else{ scanf("%lld", &v); if(x==0){ seg.update_min(y, z, v); }else if(x==1){ seg.update_max(y, z, v); }else if(x==2){ seg.add_val(y, z, v); } } } }