oj.uz

Submission #736555

# Submission time Handle Problem Language Result Execution time Memory
736555 2023-05-05T23:45:34 Z Ronin13 Progression (NOI20_progression) C++14
68 / 100
 1093 ms 145592 KB 
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;

const int nmax = 500001;

struct node{
    ll x, y;
    ll pr, suf;
    ll sum, lazy, lazy1;
    bool good = false;
    ll ans = 0;
    node(){
        x = y = 0;
        pr = suf = 0;
        sum = lazy1 = 0;
        lazy = -1e18;
        ans = 0;
    }
}t[4 * nmax];

node merg(node a, node b){
    node c;
    c.sum = a.sum + b.sum;
    c.pr = a.pr;
    c.suf = b.suf;
    c.x = a.x;
    c.y = b.y;
    if(a.good){
        if(b.x == a.x) c.pr += b.pr;
    }
    if(b.good){
        if(a.y == b.y) c.suf += a.suf;
    }
    if(a.good && b.good && a.x == b.x)
        c.good = true;
    c.ans = max(a.ans, b.ans);
    if(a.y == b.x){
        c.ans = max(c.ans, a.suf + b.pr);
    }
    return c;
}
//lazy minichebis lazy1 damatebis
void push1(int v, int l, int r){
    if(t[v].lazy == -1e18)return;
    t[v * 2].lazy = t[v].lazy;
    t[v * 2].lazy1 = 0;
    t[v * 2 + 1].lazy = t[v].lazy;
    t[v * 2 + 1].lazy1 = 0;
    int m = (l + r) /2;
    t[v * 2].sum = (ll)(m - l + 1) * t[v].lazy;
    t[v * 2 + 1].sum = (ll)(r - m) * t[v].lazy;
    t[v * 2].good = true;
    t[v * 2].pr = t[v * 2].suf = m - l + 1;
    t[v * 2].x = t[v * 2].y = t[v].lazy;
    t[v * 2 + 1].good = true;
    t[v * 2 + 1].pr = t[v * 2 + 1].suf = r - m;
    t[v * 2 + 1].x = t[v * 2 + 1].y = t[v].lazy;
    t[v].lazy = -1e18;
}

void push2(int v, int l, int r){
    if(t[v].lazy1 == 0) return;
    ll m = (l + r) / 2;
    if(t[v * 2].lazy != -1e18) t[v * 2].lazy += t[v].lazy1;
    if(t[v * 2 + 1].lazy != -1e18) t[v * 2 + 1].lazy += t[v].lazy1;
    t[v * 2].lazy1 += t[v].lazy1;
    t[v * 2 + 1].lazy1 += t[v].lazy1;
    t[v * 2].x += t[v].lazy1;
    t[v * 2].y += t[v].lazy1;
    t[v * 2 + 1].x += t[v].lazy1;
    t[v * 2 + 1].y += t[v].lazy1;
    t[v * 2].sum += t[v].lazy1 * (ll)(m - l + 1);
    t[v * 2 + 1].sum += t[v].lazy1 * (ll)(r - m);
    t[v].lazy1 = 0;
}

void updran1(int v, int l, int r, int st, int fin, ll val){//minicheba intervalze
    if(l > fin || r < st)
        return;
    if(l >= st && r <= fin){
        t[v].sum = val * (ll)(r - l + 1);
        t[v].x = t[v].y = val;
        t[v].pr = t[v].suf = r - l + 1;
        t[v].lazy = val;
        t[v].lazy1 = 0;
        t[v].good = true;
        return;
    }
    push1(v, l, r);
    push2(v, l, r);
    int m = (l + r) / 2;
    updran1(2 * v, l, m, st, fin, val);
    updran1(2 * v + 1, m + 1, r, st, fin, val);
    t[v] = merg(t[2 * v], t[2 * v + 1]);
}


void updran2(int v, int l, int r, int st, int fin, ll val){
    if(l > fin || r < st)
        return;
    if(l >= st && r <= fin){
        t[v].sum += val * (ll)(r - l + 1);
        t[v].x += val;
        t[v].y += val;
        if(t[v].lazy != -1e18) t[v].lazy += val;
        t[v].lazy1 += val;
        return;
    }
    push1(v, l, r);
    push2(v, l, r);
    int m = (l + r) / 2;
    updran2(2 * v, l, m, st, fin, val);
    updran2(2 * v + 1, m + 1, r, st, fin, val);
    t[v] = merg(t[2 * v], t[2 * v + 1]);
}

void upd_p(int v, int l, int r, int pos, ll val){
    if(l > pos || r < pos){
        return;
    }
    if(l == r){
        t[v].sum = val;
        t[v].x = t[v].y = val;
        t[v].lazy = -1e18;
        t[v].lazy1 = 0;
        t[v].pr = t[v].suf = 1;
        t[v].ans = 1;
        t[v].good = true;
        return;
    }
    push1(v, l, r);
    push2(v, l, r);
    int m = (l + r) / 2;
    upd_p(2 * v, l, m, pos, val);
    upd_p(2 * v + 1, m + 1, r, pos, val);
    t[v] = merg(t[2 * v], t[2 * v + 1]);
}

ll getsum(int v, int l, int r, int st, int fin){
    if(l > fin || r < st)
        return 0;
    if(l >= st && r <= fin)
        return t[v].sum;
    push1(v, l, r);
    push2(v, l, r);
    int m = (l + r) / 2;
    return getsum(2 * v, l, m,st, fin) + getsum(2 * v + 1, m + 1, r, st, fin);
}

node getans(int v, int l, int r, int tl, int tr){
    if(l == tl && r == tr){
        return t[v];
    }
    push1(v, l, r);
    push2(v, l, r);
    int m = (l + r) / 2;
    if(tl > m)
        return getans(2 * v + 1, m + 1, r, tl, tr);
    if(tr <= m)
        return getans(2 * v, l, m, tl, tr);
    return merg(getans(2 * v, l, m, tl, m), getans(2 * v + 1, m + 1, r, m + 1, tr));
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n, q; cin >> n >> q;
    ll a[n + 1];
    for(int i = 1; i<= n; ++i){
        cin >> a[i];
    }
    for(int i = 2; i <= n; i++){
        upd_p(1, 1, n, i - 1, a[i] - a[i - 1]);
    }
    while(q--){
        int t; cin >> t;
        if(t == 3){
            int l, r; cin >> l >> r;
            if(l == r) cout << 1 << "\n";
            else
            cout << getans(1, 1, n, l, r - 1).ans + 1 << "\n";
        }
        if(t == 1){
            ll l, r, s, c; cin >> l >> r >> s >> c;
            if(l > 1){
                ll x = getsum(1, 1, n, l - 1, l - 1);
                upd_p(1, 1, n, l - 1, s + x);
            }
            else a[1] += s;
            updran2(1,1, n, l, r - 1, c);
            ll val = s + c * (r - l);
            val = -val + getsum(1, 1, n, r, r);
            if(r != n)upd_p(1, 1, n, r, val);
        }
        if(t == 2){
            ll l, r, s, c; cin >> l >> r >> s >> c;

            ll y =  getsum(1, 1, n, 1, r) + a[1];
            if(l > 1){
                ll x = getsum(1, 1, n, 1, l - 2) + a[1];
                upd_p(1, 1, n, l - 1, s - x);
            }
            if(r < n){
                ll x = y;
                upd_p(1, 1, n, r, x - s - (r - l) * c);
            }
            if(l == 1){
                a[1] = s;
            }
            updran1(1, 1, n, l, r - 1, c);
        }
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 539 ms 144716 KB Output is correct
2 Correct 162 ms 141908 KB Output is correct
3 Correct 159 ms 142032 KB Output is correct
4 Correct 162 ms 141992 KB Output is correct
5 Correct 164 ms 141984 KB Output is correct
6 Correct 174 ms 142008 KB Output is correct
7 Correct 158 ms 141980 KB Output is correct
8 Correct 54 ms 141208 KB Output is correct
9 Correct 55 ms 141128 KB Output is correct
10 Correct 60 ms 141096 KB Output is correct
11 Correct 510 ms 144700 KB Output is correct
12 Correct 505 ms 144704 KB Output is correct
13 Correct 544 ms 144844 KB Output is correct
14 Correct 496 ms 144928 KB Output is correct
15 Correct 503 ms 144972 KB Output is correct
16 Correct 505 ms 144972 KB Output is correct
17 Correct 496 ms 145052 KB Output is correct
18 Correct 491 ms 144608 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 57 ms 141132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 145088 KB Output is correct
2 Correct 137 ms 142104 KB Output is correct
3 Correct 134 ms 142108 KB Output is correct
4 Correct 129 ms 142012 KB Output is correct
5 Correct 138 ms 142248 KB Output is correct
6 Correct 145 ms 142268 KB Output is correct
7 Correct 134 ms 142240 KB Output is correct
8 Correct 56 ms 141116 KB Output is correct
9 Correct 58 ms 141188 KB Output is correct
10 Correct 57 ms 141148 KB Output is correct
11 Correct 456 ms 144924 KB Output is correct
12 Correct 431 ms 145056 KB Output is correct
13 Correct 452 ms 144844 KB Output is correct
14 Correct 445 ms 144840 KB Output is correct
15 Correct 432 ms 145124 KB Output is correct
16 Correct 500 ms 145444 KB Output is correct
17 Correct 459 ms 145412 KB Output is correct
18 Correct 454 ms 145592 KB Output is correct
19 Correct 421 ms 144776 KB Output is correct
20 Correct 421 ms 144720 KB Output is correct
21 Correct 412 ms 144748 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 921 ms 144496 KB Output is correct
2 Correct 232 ms 141644 KB Output is correct
3 Correct 233 ms 141616 KB Output is correct
4 Correct 236 ms 141600 KB Output is correct
5 Correct 237 ms 141724 KB Output is correct
6 Correct 235 ms 141644 KB Output is correct
7 Correct 237 ms 141600 KB Output is correct
8 Correct 57 ms 141144 KB Output is correct
9 Correct 56 ms 141164 KB Output is correct
10 Correct 56 ms 141132 KB Output is correct
11 Correct 928 ms 144036 KB Output is correct
12 Correct 918 ms 143944 KB Output is correct
13 Correct 921 ms 143944 KB Output is correct
14 Correct 911 ms 143832 KB Output is correct
15 Correct 923 ms 143740 KB Output is correct
16 Correct 944 ms 144012 KB Output is correct
17 Correct 956 ms 143836 KB Output is correct
18 Correct 971 ms 143948 KB Output is correct
19 Correct 951 ms 143740 KB Output is correct
20 Correct 920 ms 143808 KB Output is correct
21 Correct 912 ms 143692 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 145088 KB Output is correct
2 Correct 137 ms 142104 KB Output is correct
3 Correct 134 ms 142108 KB Output is correct
4 Correct 129 ms 142012 KB Output is correct
5 Correct 138 ms 142248 KB Output is correct
6 Correct 145 ms 142268 KB Output is correct
7 Correct 134 ms 142240 KB Output is correct
8 Correct 56 ms 141116 KB Output is correct
9 Correct 58 ms 141188 KB Output is correct
10 Correct 57 ms 141148 KB Output is correct
11 Correct 456 ms 144924 KB Output is correct
12 Correct 431 ms 145056 KB Output is correct
13 Correct 452 ms 144844 KB Output is correct
14 Correct 445 ms 144840 KB Output is correct
15 Correct 432 ms 145124 KB Output is correct
16 Correct 500 ms 145444 KB Output is correct
17 Correct 459 ms 145412 KB Output is correct
18 Correct 454 ms 145592 KB Output is correct
19 Correct 421 ms 144776 KB Output is correct
20 Correct 421 ms 144720 KB Output is correct
21 Correct 412 ms 144748 KB Output is correct
22 Correct 992 ms 144032 KB Output is correct
23 Correct 234 ms 141636 KB Output is correct
24 Correct 219 ms 141548 KB Output is correct
25 Correct 217 ms 141636 KB Output is correct
26 Correct 220 ms 141592 KB Output is correct
27 Correct 218 ms 141740 KB Output is correct
28 Correct 221 ms 141632 KB Output is correct
29 Correct 57 ms 141148 KB Output is correct
30 Correct 55 ms 141128 KB Output is correct
31 Correct 56 ms 141116 KB Output is correct
32 Correct 1010 ms 144224 KB Output is correct
33 Correct 1022 ms 143952 KB Output is correct
34 Correct 1049 ms 144296 KB Output is correct
35 Correct 1022 ms 144236 KB Output is correct
36 Correct 793 ms 144356 KB Output is correct
37 Correct 803 ms 144332 KB Output is correct
38 Correct 797 ms 144252 KB Output is correct
39 Correct 996 ms 144072 KB Output is correct
40 Correct 1042 ms 144076 KB Output is correct
41 Correct 1093 ms 144420 KB Output is correct
42 Correct 1014 ms 144200 KB Output is correct
43 Correct 1002 ms 144024 KB Output is correct
44 Correct 985 ms 144176 KB Output is correct
45 Correct 1004 ms 144016 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 539 ms 144716 KB Output is correct
2 Correct 162 ms 141908 KB Output is correct
3 Correct 159 ms 142032 KB Output is correct
4 Correct 162 ms 141992 KB Output is correct
5 Correct 164 ms 141984 KB Output is correct
6 Correct 174 ms 142008 KB Output is correct
7 Correct 158 ms 141980 KB Output is correct
8 Correct 54 ms 141208 KB Output is correct
9 Correct 55 ms 141128 KB Output is correct
10 Correct 60 ms 141096 KB Output is correct
11 Correct 510 ms 144700 KB Output is correct
12 Correct 505 ms 144704 KB Output is correct
13 Correct 544 ms 144844 KB Output is correct
14 Correct 496 ms 144928 KB Output is correct
15 Correct 503 ms 144972 KB Output is correct
16 Correct 505 ms 144972 KB Output is correct
17 Correct 496 ms 145052 KB Output is correct
18 Correct 491 ms 144608 KB Output is correct
19 Incorrect 57 ms 141132 KB Output isn't correct
20 Halted 0 ms 0 KB -