oj.uz

Submission #236852

# Submission time Handle Problem Language Result Execution time Memory
236852 2020-06-03T15:08:09 Z egekabas Triple Jump (JOI19_jumps) C++14
100 / 100
 1587 ms 60152 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<int, int>    pii;
typedef pair<ull, ull>    pull;
typedef pair<ld, ld>  pld;
pii merge(pii a, pii b){
    return mp(max(a.ff, b.ff), max(a.ss, b.ss));
}
int n;
int a[500009];
pii seg[2000009];
int lazy[2000009];
void push(int v){
    lazy[2*v] = max(lazy[2*v], lazy[v]);
    lazy[2*v+1] = max(lazy[2*v+1], lazy[v]);
    seg[2*v].ff = max(seg[2*v].ff, seg[2*v].ss+lazy[2*v]);
    seg[2*v+1].ff = max(seg[2*v+1].ff, seg[2*v+1].ss+lazy[2*v+1]);
    lazy[v] = 0;
}
void build(int v, int tl, int tr){
    if(tl == tr){
        seg[v] = {a[tl], a[tl]};
        return;
    }
    build(2*v, tl, (tl+tr)/2);
    build(2*v+1, (tl+tr)/2+1, tr);
    seg[v] = merge(seg[2*v], seg[2*v+1]);
}
void upd(int v, int tl, int tr, int l, int r, int val){
    if(r < tl || tr < l)
        return;
    if(l <= tl && tr <= r){
        lazy[v] = max(lazy[v], val);
        seg[v].ff = max(seg[v].ff, seg[v].ss+lazy[v]);
    }
    else{
        push(v);
        upd(2*v, tl, (tl+tr)/2, l, r, val);
        upd(2*v+1, (tl+tr)/2+1, tr, l, r, val);
        seg[v] = merge(seg[2*v], seg[2*v+1]);
    }
}
pii get(int v, int tl, int tr, int l, int r){
    if(r < tl || tr < l)
        return {0, 0};
    if(l <= tl && tr <= r)
        return seg[v];
    else{
        push(v);
        return merge(get(2*v, tl, (tl+tr)/2, l, r), get(2*v+1, (tl+tr)/2+1, tr, l, r));
    }
}
int q;
vector<pii> qu[500009];
int ans[500009];
int main() {
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    build(1, 0, n-1);
    cin >> q;
    for(int i = 0; i < q; ++i){
        int l, r;
        cin >> l >> r;
        qu[l-1].pb({r-1, i});
    }
    deque<pii> inc;
    for(int i = n-1; i >= 0; --i){
        for(auto u : inc){
            upd(1, 0, n-1, 2*u.ss-i, n-1, a[i]+u.ff);
            if(u.ff >= a[i])
                break;
        }
        while(inc.size() > 0){
            if(inc.front().ff <= a[i])
                inc.pop_front();
            else
                break;
        }
        inc.push_front({a[i], i});
        for(auto u : qu[i])
            ans[u.ss] = get(1, 0, n-1, i+2, u.ff).ff;

    }
    for(int i = 0; i < q; ++i)
        cout << ans[i] << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 12 ms 12160 KB Output is correct
5 Correct 12 ms 12032 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 12 ms 12160 KB Output is correct
8 Correct 11 ms 12032 KB Output is correct
9 Correct 12 ms 12032 KB Output is correct
10 Correct 12 ms 12032 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 12 ms 12160 KB Output is correct
5 Correct 12 ms 12032 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 12 ms 12160 KB Output is correct
8 Correct 11 ms 12032 KB Output is correct
9 Correct 12 ms 12032 KB Output is correct
10 Correct 12 ms 12032 KB Output is correct
11 Correct 614 ms 25884 KB Output is correct
12 Correct 607 ms 30300 KB Output is correct
13 Correct 582 ms 30484 KB Output is correct
14 Correct 591 ms 30456 KB Output is correct
15 Correct 605 ms 30356 KB Output is correct
16 Correct 571 ms 29692 KB Output is correct
17 Correct 582 ms 29816 KB Output is correct
18 Correct 593 ms 29760 KB Output is correct
19 Correct 607 ms 30328 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 19064 KB Output is correct
2 Correct 170 ms 20728 KB Output is correct
3 Correct 188 ms 19064 KB Output is correct
4 Correct 223 ms 19064 KB Output is correct
5 Correct 223 ms 19064 KB Output is correct
6 Correct 196 ms 19192 KB Output is correct
7 Correct 197 ms 19960 KB Output is correct
8 Correct 196 ms 19960 KB Output is correct
9 Correct 211 ms 20344 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 12 ms 12160 KB Output is correct
5 Correct 12 ms 12032 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 12 ms 12160 KB Output is correct
8 Correct 11 ms 12032 KB Output is correct
9 Correct 12 ms 12032 KB Output is correct
10 Correct 12 ms 12032 KB Output is correct
11 Correct 614 ms 25884 KB Output is correct
12 Correct 607 ms 30300 KB Output is correct
13 Correct 582 ms 30484 KB Output is correct
14 Correct 591 ms 30456 KB Output is correct
15 Correct 605 ms 30356 KB Output is correct
16 Correct 571 ms 29692 KB Output is correct
17 Correct 582 ms 29816 KB Output is correct
18 Correct 593 ms 29760 KB Output is correct
19 Correct 607 ms 30328 KB Output is correct
20 Correct 236 ms 19064 KB Output is correct
21 Correct 170 ms 20728 KB Output is correct
22 Correct 188 ms 19064 KB Output is correct
23 Correct 223 ms 19064 KB Output is correct
24 Correct 223 ms 19064 KB Output is correct
25 Correct 196 ms 19192 KB Output is correct
26 Correct 197 ms 19960 KB Output is correct
27 Correct 196 ms 19960 KB Output is correct
28 Correct 211 ms 20344 KB Output is correct
29 Correct 1587 ms 54164 KB Output is correct
30 Correct 1438 ms 58372 KB Output is correct
31 Correct 1462 ms 54260 KB Output is correct
32 Correct 1526 ms 54264 KB Output is correct
33 Correct 1521 ms 54264 KB Output is correct
34 Correct 1441 ms 52068 KB Output is correct
35 Correct 1462 ms 51880 KB Output is correct
36 Correct 1467 ms 51900 KB Output is correct
37 Correct 1517 ms 53128 KB Output is correct
38 Correct 1266 ms 60152 KB Output is correct
39 Correct 1269 ms 59940 KB Output is correct
40 Correct 1172 ms 56672 KB Output is correct
41 Correct 1209 ms 56120 KB Output is correct
42 Correct 1183 ms 56236 KB Output is correct
43 Correct 1234 ms 58104 KB Output is correct
44 Correct 1330 ms 59460 KB Output is correct
45 Correct 1300 ms 59424 KB Output is correct
46 Correct 1213 ms 56144 KB Output is correct
47 Correct 1217 ms 55828 KB Output is correct
48 Correct 1182 ms 55828 KB Output is correct
49 Correct 1253 ms 57976 KB Output is correct
50 Correct 1380 ms 57512 KB Output is correct
51 Correct 1414 ms 57536 KB Output is correct
52 Correct 1320 ms 55124 KB Output is correct
53 Correct 1324 ms 54888 KB Output is correct
54 Correct 1309 ms 54648 KB Output is correct
55 Correct 1359 ms 56368 KB Output is correct