Submit Info #22249

Problem Lang User Status Time Memory
Range Chmin Chmax Add Range Sum cpp Mehedi AC 401 ms 39.75 MiB

ケース詳細
Name Status Time Memory
example_00 AC 21 ms 37.30 MiB
max_random_00 AC 395 ms 39.75 MiB
max_random_01 AC 397 ms 39.73 MiB
max_random_02 AC 401 ms 39.67 MiB
medium_00 AC 22 ms 37.36 MiB
medium_01 AC 21 ms 37.30 MiB
medium_02 AC 21 ms 37.36 MiB
random_00 AC 297 ms 38.91 MiB
random_01 AC 291 ms 39.12 MiB
random_02 AC 202 ms 38.19 MiB
small_00 AC 19 ms 37.30 MiB
small_01 AC 20 ms 37.30 MiB
small_02 AC 20 ms 37.31 MiB
small_03 AC 16 ms 37.36 MiB
small_04 AC 20 ms 37.28 MiB
small_05 AC 21 ms 37.27 MiB
small_06 AC 21 ms 37.30 MiB
small_07 AC 21 ms 37.29 MiB
small_08 AC 22 ms 37.27 MiB
small_09 AC 21 ms 37.30 MiB

/*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/ //#pragma GCC optimize("O3,unroll-loops") //#pragma GCC target("avx,avx2,fma") #include <bits/stdc++.h> using namespace std; #define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); typedef long long ll; using pii = pair<ll, ll>; const double PI = acos(-1.0); const ll mod = 1e9 + 7; //const ll mod = 998244353; inline void normal(ll &a) { a %= mod; (a < 0) && (a += mod); } inline ll modMul(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); return (a * b) % mod; } inline ll modAdd(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); return (a + b) % mod; } inline ll modSub(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); a -= b; normal(a); return a; } inline ll modPow(ll b, ll p) { ll r = 1; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; } inline ll modInverse(ll a) { return modPow(a, mod - 2); } inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); } #define si(x) scanf("%d",&x) #define sii(x,y) scanf("%d %d",&x,&y) #define siii(x,y,z) scanf("%d %d %d",&x,&y,&z) #define sl(x) scanf("%lld",&x) #define sll(x,y) scanf("%lld %lld",&x,&y) #define slll(x,y,z) scanf("%lld %lld %lld",&x,&y,&z) #define ss(ch) scanf("%s",ch) #define pi(x) printf("%d",x) //#define pii(x,y) printf("%d %d",x,y) #define piii(x,y,z) printf("%d %d %d",x,y,z) #define pl(x) printf("%lld",x) #define pll(x,y) printf("%lld %lld",x,y) #define plll(x,y,z) printf("%lld %lld %lld",x,y,z) #define ps(ch) printf("%s",ch) #define F(i,a,b) for(int i= a; i <= b; i++) #define R(i,b,a) for(int i= b; i >= a; i--) #define REP(i,n) for(int i = 0; i < (n); i++) int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1}; int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1}; int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2}; int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1}; /* for Random Number generate mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); */ ///** template < typename F, typename S >ostream& operator << ( ostream& os, const pair< F, S > & p ) {return os << "(" << p.first << ", " << p.second << ")";} template < typename T >ostream &operator << ( ostream & os, const vector< T > &v ) {os << "{"; for (auto it = v.begin(); it != v.end(); ++it) {if ( it != v.begin() ) os << ", "; os << *it;} return os << "}";} template < typename T >ostream &operator << ( ostream & os, const set< T > &v ) {os << "["; for (auto it = v.begin(); it != v.end(); ++it) {if ( it != v.begin()) os << ", "; os << *it;} return os << "]";} template < typename F, typename S >ostream &operator << ( ostream & os, const map< F, S > &v ) {os << "["; for (auto it = v.begin(); it != v.end(); ++it) {if ( it != v.begin() ) os << ", "; os << it -> first << " = " << it -> second ;} return os << "]";} #define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0) clock_t tStart = clock(); #define timeStamp dbg("Execution Time: ", (double)(clock() - tStart)/CLOCKS_PER_SEC) void faltu () { cerr << endl; } template <typename T>void faltu( T a[], int n ) {for (int i = 0; i < n; ++i) cerr << a[i] << ' '; cerr << endl;} template <typename T, typename ... hello> void faltu( T arg, const hello &... rest) { cerr << arg << ' '; faltu(rest...); } // Program showing a policy-based data structure. #include <ext/pb_ds/assoc_container.hpp> // Common file #include <ext/pb_ds/tree_policy.hpp> #include <functional> // for less using namespace __gnu_pbds; // GNU link : https://goo.gl/WVDL6g typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> new_data_set; // find_by_order(k) – ফাংশনটি kth ordered element এর একটা পয়েন্টার রিটার্ন করে। অর্থাৎ তুমি চাইলেই kth ইন্ডেক্সে কি আছে, সেটা জেনে ফেলতে পারছো! // order_of_key(x) – ফাংশনটি x এলিমেন্টটা কোন পজিশনে আছে সেটা বলে দেয়। //*//**___________________________________________________**/ const int N = 200006; class SegmentTree { public: #define Left rt << 1 #define Right rt << 1|1 struct node { ll s, mn, mx, len; node(ll a = 0, ll b = 0, ll c = 0, ll d = 0) { s = a; mn = b; mx = c; len = d; } }; node T[N << 2]; pii lazy[N << 2]; ll a[N]; void build(ll rt, ll l, ll r) { T[rt].len = r - l + 1; if (l == r) { T[rt].mn = T[rt].mx = T[rt].s = a[l]; return; } ll mid = (l + r) >> 1; build(Left, l, mid); build(Right, mid + 1, r); lazy[rt] = make_pair(1, 0); combineKids(rt); } void update(ll rt, ll l, ll r, ll x, ll y, const pii& v) { if (y < l || r < x)return; if (l >= x && r <= y) { merge(rt, v); return; } propagate(rt); ll mid = (l + r) >> 1; update(Left, l, mid, x, y, v); update(Right, mid + 1, r, x, y, v); combineKids(rt); } void minUpdate(ll rt, ll l, ll r, ll x, ll y, ll v) { if (y < l || r < x || T[rt].mx <= v)return; if (l >= x && r <= y && v <= T[rt].mn) { pii p(0, v); merge(rt, p); return; } propagate(rt); ll mid = (l + r) >> 1; minUpdate(Left, l, mid, x, y, v); minUpdate(Right, mid + 1, r, x, y, v); combineKids(rt); } void maxUpdate(ll rt, ll l, ll r, ll x, ll y, ll v) { if (y < l || r < x || T[rt].mn >= v)return; if (l >= x && r <= y && v >= T[rt].mx) { pii p(0, v); merge(rt, p); return; } propagate(rt); ll mid = (l + r) >> 1; maxUpdate(Left, l, mid, x, y, v); maxUpdate(Right, mid + 1, r, x, y, v); combineKids(rt); } ll Query(ll rt, ll l, ll r, ll x, ll y) { //if (y < l || r < x)return 0; if (l >= x && r <= y) { return T[rt].s; } propagate(rt); ll mid = (l + r) >> 1; if (y <= mid)return Query(Left, l, mid, x, y); if (x > mid)return Query(Right, mid + 1, r, x, y); return add(Query(Left, l, mid, x, y), Query(Right, mid + 1, r, x, y)); } private: ll add(ll x, ll y) { return (x + y); } void combineKids(ll rt) { T[rt].s = add(T[Left].s, T[Right].s); T[rt].mn = min(T[Left].mn, T[Right].mn); T[rt].mx = max(T[Left].mx, T[Right].mx); } void merge(ll rt, const pii& v) { ll b = v.second; if (v.first) { T[rt].s += T[rt].len * b; T[rt].mn += b; T[rt].mx += b; lazy[rt].second += b; } else { T[rt].s = T[rt].len * b; lazy[rt].first = 0; lazy[rt].second = T[rt].mn = T[rt].mx = b; } } void propagate(ll rt) { if (lazy[rt] == pii(1, 0))return; merge(Left, lazy[rt]); merge(Right, lazy[rt]); lazy[rt] = make_pair(1, 0); } }; SegmentTree Tree; int main() { /* #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); freopen("error.txt", "w", stderr); #endif //*/ ll n, q; cin >> n >> q; for (int i = 1; i <= n; i++)cin >> Tree.a[i]; Tree.build(1, 1, n); while (q--) { int cmd, l, r; ll val; cin >> cmd >> l >> r; l++; if (cmd < 2)cin >> val; if (cmd == 0) Tree.minUpdate(1, 1, n, l, r, val); else if (cmd == 1)Tree.maxUpdate(1, 1, n, l, r, val); else if (cmd == 2) { pii v(1, 0); cin >> v.second; Tree.update(1, 1, n, l, r, v); } else cout << Tree.Query(1, 1, n, l, r) << "\n"; } }