oj.uz

답안 #736551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736551 2023-05-05T23:35:11 Z Ronin13 Progression (NOI20_progression) C++14
57 / 100
 1188 ms 153488 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 = -1e18;
    t[v * 2 + 1].lazy = t[v].lazy;
    t[v * 2 + 1].lazy1 = -1e18;
    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;
            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 = getsum(1, 1, n, 1, r) + a[1];
                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

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 152316 KB Output is correct
2 Correct 162 ms 144492 KB Output is correct
3 Correct 167 ms 144336 KB Output is correct
4 Correct 162 ms 144412 KB Output is correct
5 Correct 161 ms 144464 KB Output is correct
6 Correct 161 ms 144460 KB Output is correct
7 Correct 161 ms 144400 KB Output is correct
8 Correct 56 ms 141132 KB Output is correct
9 Correct 55 ms 141180 KB Output is correct
10 Correct 55 ms 141172 KB Output is correct
11 Correct 498 ms 152076 KB Output is correct
12 Correct 521 ms 152036 KB Output is correct
13 Correct 503 ms 152400 KB Output is correct
14 Correct 501 ms 152656 KB Output is correct
15 Correct 494 ms 152324 KB Output is correct
16 Correct 505 ms 152056 KB Output is correct
17 Correct 498 ms 152108 KB Output is correct
18 Correct 516 ms 152116 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 141228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 461 ms 150592 KB Output is correct
2 Correct 139 ms 143852 KB Output is correct
3 Correct 130 ms 143788 KB Output is correct
4 Correct 129 ms 143792 KB Output is correct
5 Correct 138 ms 144028 KB Output is correct
6 Correct 139 ms 144068 KB Output is correct
7 Correct 147 ms 143964 KB Output is correct
8 Correct 58 ms 141132 KB Output is correct
9 Correct 57 ms 141208 KB Output is correct
10 Correct 63 ms 141164 KB Output is correct
11 Correct 479 ms 149420 KB Output is correct
12 Correct 475 ms 150604 KB Output is correct
13 Correct 464 ms 149220 KB Output is correct
14 Correct 465 ms 149232 KB Output is correct
15 Correct 452 ms 150588 KB Output is correct
16 Correct 468 ms 151116 KB Output is correct
17 Correct 464 ms 151168 KB Output is correct
18 Correct 460 ms 151448 KB Output is correct
19 Correct 413 ms 150584 KB Output is correct
20 Correct 430 ms 150532 KB Output is correct
21 Correct 431 ms 150472 KB Output is correct

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 935 ms 153488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 461 ms 150592 KB Output is correct
2 Correct 139 ms 143852 KB Output is correct
3 Correct 130 ms 143788 KB Output is correct
4 Correct 129 ms 143792 KB Output is correct
5 Correct 138 ms 144028 KB Output is correct
6 Correct 139 ms 144068 KB Output is correct
7 Correct 147 ms 143964 KB Output is correct
8 Correct 58 ms 141132 KB Output is correct
9 Correct 57 ms 141208 KB Output is correct
10 Correct 63 ms 141164 KB Output is correct
11 Correct 479 ms 149420 KB Output is correct
12 Correct 475 ms 150604 KB Output is correct
13 Correct 464 ms 149220 KB Output is correct
14 Correct 465 ms 149232 KB Output is correct
15 Correct 452 ms 150588 KB Output is correct
16 Correct 468 ms 151116 KB Output is correct
17 Correct 464 ms 151168 KB Output is correct
18 Correct 460 ms 151448 KB Output is correct
19 Correct 413 ms 150584 KB Output is correct
20 Correct 430 ms 150532 KB Output is correct
21 Correct 431 ms 150472 KB Output is correct
22 Correct 1031 ms 152888 KB Output is correct
23 Correct 219 ms 144456 KB Output is correct
24 Correct 216 ms 144456 KB Output is correct
25 Correct 230 ms 144392 KB Output is correct
26 Correct 232 ms 144400 KB Output is correct
27 Correct 232 ms 144560 KB Output is correct
28 Correct 230 ms 144460 KB Output is correct
29 Correct 57 ms 141124 KB Output is correct
30 Correct 56 ms 141092 KB Output is correct
31 Correct 56 ms 141172 KB Output is correct
32 Correct 1032 ms 150296 KB Output is correct
33 Correct 1026 ms 153000 KB Output is correct
34 Correct 1034 ms 150072 KB Output is correct
35 Correct 1035 ms 150092 KB Output is correct
36 Correct 830 ms 150004 KB Output is correct
37 Correct 840 ms 149916 KB Output is correct
38 Correct 854 ms 149984 KB Output is correct
39 Correct 1152 ms 152760 KB Output is correct
40 Correct 1188 ms 153088 KB Output is correct
41 Correct 1059 ms 152988 KB Output is correct
42 Correct 1076 ms 152968 KB Output is correct
43 Correct 1006 ms 152764 KB Output is correct
44 Correct 1014 ms 152784 KB Output is correct
45 Correct 1008 ms 152836 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 152316 KB Output is correct
2 Correct 162 ms 144492 KB Output is correct
3 Correct 167 ms 144336 KB Output is correct
4 Correct 162 ms 144412 KB Output is correct
5 Correct 161 ms 144464 KB Output is correct
6 Correct 161 ms 144460 KB Output is correct
7 Correct 161 ms 144400 KB Output is correct
8 Correct 56 ms 141132 KB Output is correct
9 Correct 55 ms 141180 KB Output is correct
10 Correct 55 ms 141172 KB Output is correct
11 Correct 498 ms 152076 KB Output is correct
12 Correct 521 ms 152036 KB Output is correct
13 Correct 503 ms 152400 KB Output is correct
14 Correct 501 ms 152656 KB Output is correct
15 Correct 494 ms 152324 KB Output is correct
16 Correct 505 ms 152056 KB Output is correct
17 Correct 498 ms 152108 KB Output is correct
18 Correct 516 ms 152116 KB Output is correct
19 Incorrect 60 ms 141228 KB Output isn't correct
20 Halted 0 ms 0 KB -