oj.uz

Submission #579039

# Submission time Handle Problem Language Result Execution time Memory
579039 2022-06-18T10:25:17 Z wiwiho Triple Jump (JOI19_jumps) C++14
100 / 100
 1256 ms 108440 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

struct Node{
    int v = 0, tag = 0;
};

int n;
vector<Node> st;
#define lc 2 * id + 1
#define rc 2 * id + 2

void addtag(int v, int id){
    st[id].v += v;
    st[id].tag += v;
}

void push(int id){
    addtag(st[id].tag, lc);
    addtag(st[id].tag, rc);
    st[id].tag = 0;
}

void pull(int id){
    st[id].v = max(st[lc].v, st[rc].v);
}

void modify(int l, int r, int v, int L = 1, int R = n, int id = 0){
    if(l <= L && R <= r){
        addtag(v, id);
        return;
    }
    //cerr << l << " " << r << " " << L << " " << R << "\n";
    push(id);
    int M = (L + R) / 2;
    if(r <= M) modify(l, r, v, L, M, lc);
    else if(l > M) modify(l, r, v, M + 1, R, rc);
    else{
        modify(l, r, v, L, M, lc);
        modify(l, r, v, M + 1, R, rc);
    }
    pull(id);
}

int query(int l, int r, int L = 1, int R = n, int id = 0){
    if(l <= L && R <= r){
        return st[id].v;
    }
    push(id);
    int M = (L + R) / 2;
    if(r <= M) return query(l, r, L, M, lc);
    else if(l > M) return query(l, r, M + 1, R, rc);
    else return max(query(l, r, L, M, lc), query(l, r, M + 1, R, rc));
}

int main(){
    StarBurstStream

    cin >> n;

    vector<int> a(n + 1);
    vector<vector<pii>> ev(n + 1);
    deque<int> dq;
    st.resize(4 * n);

    auto add = [&](int i, int j){
        int len = j - i;
        int k = i + 2 * len;
        ev[i].eb(mp(k, a[i] + a[j]));
    };

    for(int i = 1; i <= n; i++){
        cin >> a[i];
        modify(i, i, a[i]);
        
        while(!dq.empty() && a[dq.back()] < a[i]){
            add(dq.back(), i);
            dq.pob;
        }
        if(!dq.empty()) add(dq.back(), i);
        dq.eb(i);
    }

    vector<vector<pii>> qry(n + 1);
    int q;
    cin >> q;
    for(int i = 0; i < q; i++){
        int l, r;
        cin >> l >> r;
        qry[l].eb(mp(r, i));
    }

    map<int, int> mx;
    vector<int> ans(q);
    mx[1] = 0;

    auto upd = [&](int p, int v){
        if(p > n) return;
        //cerr << "upd " << p << " " << v << "\n";

        auto it = mx.upper_bound(p);
        it--;
        if(v <= it->S) return;

        int lp = max(p, it->F);
        int nxt = next(it) == mx.end() ? n + 1 : next(it)->F;
        modify(lp, nxt - 1, v - it->S);
        mx[p] = v;
        it = mx.upper_bound(p);

        while(it != mx.end() && it->S <= v){
            nxt = next(it) == mx.end() ? n + 1 : next(it)->F;
            modify(it->F, nxt - 1, v - it->S);
            it = mx.erase(it);
        }
        //printv(mx, cerr);
    };

    for(int i = n; i >= 1; i--){

        for(pii t : ev[i]){
            upd(t.F, t.S);
        }

        for(pii t : qry[i]){
            int r, id;
            tie(r, id) = t;
            ans[id] = query(i, r);
        }
    }

    for(int i : ans) cout << i << "\n";

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 237 ms 14800 KB Output is correct
12 Correct 300 ms 14636 KB Output is correct
13 Correct 220 ms 14680 KB Output is correct
14 Correct 274 ms 14796 KB Output is correct
15 Correct 221 ms 14924 KB Output is correct
16 Correct 223 ms 14192 KB Output is correct
17 Correct 275 ms 14080 KB Output is correct
18 Correct 236 ms 14028 KB Output is correct
19 Correct 256 ms 14608 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 24240 KB Output is correct
2 Correct 233 ms 32368 KB Output is correct
3 Correct 164 ms 23764 KB Output is correct
4 Correct 265 ms 25992 KB Output is correct
5 Correct 261 ms 25984 KB Output is correct
6 Correct 254 ms 25424 KB Output is correct
7 Correct 297 ms 25348 KB Output is correct
8 Correct 245 ms 25232 KB Output is correct
9 Correct 305 ms 25568 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 237 ms 14800 KB Output is correct
12 Correct 300 ms 14636 KB Output is correct
13 Correct 220 ms 14680 KB Output is correct
14 Correct 274 ms 14796 KB Output is correct
15 Correct 221 ms 14924 KB Output is correct
16 Correct 223 ms 14192 KB Output is correct
17 Correct 275 ms 14080 KB Output is correct
18 Correct 236 ms 14028 KB Output is correct
19 Correct 256 ms 14608 KB Output is correct
20 Correct 249 ms 24240 KB Output is correct
21 Correct 233 ms 32368 KB Output is correct
22 Correct 164 ms 23764 KB Output is correct
23 Correct 265 ms 25992 KB Output is correct
24 Correct 261 ms 25984 KB Output is correct
25 Correct 254 ms 25424 KB Output is correct
26 Correct 297 ms 25348 KB Output is correct
27 Correct 245 ms 25232 KB Output is correct
28 Correct 305 ms 25568 KB Output is correct
29 Correct 1252 ms 87908 KB Output is correct
30 Correct 1102 ms 108440 KB Output is correct
31 Correct 989 ms 86944 KB Output is correct
32 Correct 1256 ms 88108 KB Output is correct
33 Correct 1202 ms 88076 KB Output is correct
34 Correct 1222 ms 85708 KB Output is correct
35 Correct 1183 ms 85324 KB Output is correct
36 Correct 1144 ms 85328 KB Output is correct
37 Correct 1175 ms 86808 KB Output is correct
38 Correct 970 ms 93772 KB Output is correct
39 Correct 952 ms 93660 KB Output is correct
40 Correct 913 ms 90344 KB Output is correct
41 Correct 913 ms 89848 KB Output is correct
42 Correct 931 ms 89852 KB Output is correct
43 Correct 923 ms 91580 KB Output is correct
44 Correct 1027 ms 93060 KB Output is correct
45 Correct 1054 ms 93068 KB Output is correct
46 Correct 1033 ms 89956 KB Output is correct
47 Correct 977 ms 89668 KB Output is correct
48 Correct 965 ms 89512 KB Output is correct
49 Correct 961 ms 91548 KB Output is correct
50 Correct 1051 ms 91184 KB Output is correct
51 Correct 1028 ms 91172 KB Output is correct
52 Correct 1025 ms 88676 KB Output is correct
53 Correct 1123 ms 88288 KB Output is correct
54 Correct 1135 ms 88612 KB Output is correct
55 Correct 1157 ms 90052 KB Output is correct