oj.uz

Submission #736557

# Submission time Handle Problem Language Result Execution time Memory
736557 2023-05-05T23:48:41 Z Ronin13 Progression (NOI20_progression) C++14
68 / 100
 1063 ms 145596 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;
    t[v].lazy1 = 0;
}

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 488 ms 145188 KB Output is correct
2 Correct 180 ms 142492 KB Output is correct
3 Correct 172 ms 142568 KB Output is correct
4 Correct 173 ms 142528 KB Output is correct
5 Correct 172 ms 142592 KB Output is correct
6 Correct 166 ms 142720 KB Output is correct
7 Correct 162 ms 142588 KB Output is correct
8 Correct 56 ms 141180 KB Output is correct
9 Correct 57 ms 141104 KB Output is correct
10 Correct 56 ms 141100 KB Output is correct
11 Correct 485 ms 145248 KB Output is correct
12 Correct 495 ms 145204 KB Output is correct
13 Correct 497 ms 145556 KB Output is correct
14 Correct 517 ms 145352 KB Output is correct
15 Correct 495 ms 145272 KB Output is correct
16 Correct 513 ms 144724 KB Output is correct
17 Correct 492 ms 144644 KB Output is correct
18 Correct 492 ms 144564 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 141216 KB Output is correct
2 Incorrect 55 ms 141180 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 443 ms 145096 KB Output is correct
2 Correct 136 ms 142120 KB Output is correct
3 Correct 132 ms 142260 KB Output is correct
4 Correct 137 ms 142172 KB Output is correct
5 Correct 143 ms 142212 KB Output is correct
6 Correct 135 ms 142156 KB Output is correct
7 Correct 148 ms 142144 KB Output is correct
8 Correct 64 ms 141216 KB Output is correct
9 Correct 56 ms 141128 KB Output is correct
10 Correct 57 ms 141164 KB Output is correct
11 Correct 480 ms 144752 KB Output is correct
12 Correct 463 ms 145120 KB Output is correct
13 Correct 467 ms 144960 KB Output is correct
14 Correct 464 ms 144840 KB Output is correct
15 Correct 440 ms 145028 KB Output is correct
16 Correct 462 ms 145408 KB Output is correct
17 Correct 475 ms 145524 KB Output is correct
18 Correct 471 ms 145596 KB Output is correct
19 Correct 417 ms 144828 KB Output is correct
20 Correct 423 ms 144740 KB Output is correct
21 Correct 460 ms 144736 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1008 ms 144496 KB Output is correct
2 Correct 233 ms 141896 KB Output is correct
3 Correct 233 ms 141868 KB Output is correct
4 Correct 238 ms 141872 KB Output is correct
5 Correct 246 ms 141864 KB Output is correct
6 Correct 246 ms 141924 KB Output is correct
7 Correct 238 ms 141900 KB Output is correct
8 Correct 57 ms 141128 KB Output is correct
9 Correct 58 ms 141120 KB Output is correct
10 Correct 59 ms 141140 KB Output is correct
11 Correct 929 ms 144412 KB Output is correct
12 Correct 915 ms 144356 KB Output is correct
13 Correct 915 ms 144332 KB Output is correct
14 Correct 929 ms 144252 KB Output is correct
15 Correct 925 ms 144372 KB Output is correct
16 Correct 947 ms 144412 KB Output is correct
17 Correct 933 ms 144276 KB Output is correct
18 Correct 988 ms 144204 KB Output is correct
19 Correct 931 ms 144136 KB Output is correct
20 Correct 922 ms 144076 KB Output is correct
21 Correct 926 ms 144284 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 443 ms 145096 KB Output is correct
2 Correct 136 ms 142120 KB Output is correct
3 Correct 132 ms 142260 KB Output is correct
4 Correct 137 ms 142172 KB Output is correct
5 Correct 143 ms 142212 KB Output is correct
6 Correct 135 ms 142156 KB Output is correct
7 Correct 148 ms 142144 KB Output is correct
8 Correct 64 ms 141216 KB Output is correct
9 Correct 56 ms 141128 KB Output is correct
10 Correct 57 ms 141164 KB Output is correct
11 Correct 480 ms 144752 KB Output is correct
12 Correct 463 ms 145120 KB Output is correct
13 Correct 467 ms 144960 KB Output is correct
14 Correct 464 ms 144840 KB Output is correct
15 Correct 440 ms 145028 KB Output is correct
16 Correct 462 ms 145408 KB Output is correct
17 Correct 475 ms 145524 KB Output is correct
18 Correct 471 ms 145596 KB Output is correct
19 Correct 417 ms 144828 KB Output is correct
20 Correct 423 ms 144740 KB Output is correct
21 Correct 460 ms 144736 KB Output is correct
22 Correct 1063 ms 144644 KB Output is correct
23 Correct 222 ms 142028 KB Output is correct
24 Correct 216 ms 142092 KB Output is correct
25 Correct 218 ms 141976 KB Output is correct
26 Correct 224 ms 141900 KB Output is correct
27 Correct 232 ms 142028 KB Output is correct
28 Correct 235 ms 142016 KB Output is correct
29 Correct 57 ms 141152 KB Output is correct
30 Correct 57 ms 141164 KB Output is correct
31 Correct 61 ms 141192 KB Output is correct
32 Correct 1016 ms 144528 KB Output is correct
33 Correct 1010 ms 144448 KB Output is correct
34 Correct 1054 ms 144492 KB Output is correct
35 Correct 1022 ms 144436 KB Output is correct
36 Correct 818 ms 144604 KB Output is correct
37 Correct 804 ms 144676 KB Output is correct
38 Correct 806 ms 144764 KB Output is correct
39 Correct 1006 ms 144452 KB Output is correct
40 Correct 1049 ms 144688 KB Output is correct
41 Correct 1033 ms 144736 KB Output is correct
42 Correct 1047 ms 144508 KB Output is correct
43 Correct 1000 ms 144520 KB Output is correct
44 Correct 991 ms 144352 KB Output is correct
45 Correct 1024 ms 144524 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 488 ms 145188 KB Output is correct
2 Correct 180 ms 142492 KB Output is correct
3 Correct 172 ms 142568 KB Output is correct
4 Correct 173 ms 142528 KB Output is correct
5 Correct 172 ms 142592 KB Output is correct
6 Correct 166 ms 142720 KB Output is correct
7 Correct 162 ms 142588 KB Output is correct
8 Correct 56 ms 141180 KB Output is correct
9 Correct 57 ms 141104 KB Output is correct
10 Correct 56 ms 141100 KB Output is correct
11 Correct 485 ms 145248 KB Output is correct
12 Correct 495 ms 145204 KB Output is correct
13 Correct 497 ms 145556 KB Output is correct
14 Correct 517 ms 145352 KB Output is correct
15 Correct 495 ms 145272 KB Output is correct
16 Correct 513 ms 144724 KB Output is correct
17 Correct 492 ms 144644 KB Output is correct
18 Correct 492 ms 144564 KB Output is correct
19 Correct 63 ms 141216 KB Output is correct
20 Incorrect 55 ms 141180 KB Output isn't correct
21 Halted 0 ms 0 KB -