oj.uz

Submission #137213

# Submission time Handle Problem Language Result Execution time Memory
137213 2019-07-27T09:19:15 Z Minnakhmetov Triple Jump (JOI19_jumps) C++14
100 / 100
 1423 ms 111988 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

const int N = 5e5 + 5, INF = 1e9;
int a[N], lm[N], rm[N], t[N * 4], up[N * 4], ans[N], mx[N * 4];
vector<pair<int, int>> ev[N], qr[N];
bool tup[N * 4];

void build(int v, int L, int R) {
    if (L == R) {
        mx[v] = a[L];
    }
    else {
        int m = (L + R) >> 1;
        build(v * 2, L, m);
        build(v * 2 + 1, m + 1, R);
        mx[v] = max(mx[v * 2], mx[v * 2 + 1]);
    }
}

void push(int v, int L, int R) {
    if (tup[v]) {
        if (L != R) {
            up[v * 2] = up[v];
            up[v * 2 + 1] = up[v];
            tup[v * 2] = 1;
            tup[v * 2 + 1] = 1;
        }
        t[v] = up[v] + mx[v];
        tup[v] = 0;
    }
}

void upd(int l, int r, int x, int v, int L, int R) {
    push(v, L, R);
    if (l > r)
        return;
    if (l == L && r == R) {
        up[v] = x;
        tup[v] = 1;
        push(v, L, R);
    }
    else {
        int m = (L + R) >> 1;
        upd(l, min(m, r), x, v * 2, L, m);
        upd(max(m + 1, l), r, x, v * 2 + 1, m + 1, R);
        t[v] = max(t[v * 2], t[v * 2 + 1]);
    }
}

int que(int l, int r, int v, int L, int R) {
    push(v, L, R);
    if (l > r)
        return -INF;
    if (l == L && r == R)
        return t[v];
    int m = (L + R) >> 1;
    return max(que(l, min(m, r), v * 2, L, m),
        que(max(m + 1, l), r, v * 2 + 1, m + 1, R));
}

signed main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    build(1, 0, n - 1);
    upd(0, n - 1, -INF, 1, 0, n - 1);

    set<pair<int, int>> st;
    st.insert({0, -INF});
    st.insert({n, INF});

    vector<int> v;
    for (int i = 0; i < n; i++) {
        while (!v.empty() && a[v.back()] < a[i])
            v.pop_back();
        lm[i] = v.empty() ? -1 : v.back();
        v.push_back(i);
    }

    v.clear();

    for (int i = n - 1; i >= 0; i--) {
        while (!v.empty() && a[v.back()] < a[i])
            v.pop_back();
        rm[i] = v.empty() ? -1 : v.back();
        v.push_back(i);
    }

    for (int i = 0; i < n; i++) {
        if (lm[i] != -1) 
            ev[lm[i]].push_back({lm[i], i});
        if (rm[i] != -1)
            ev[i].push_back({i, rm[i]});
    }

    int q;
    cin >> q;

    for (int i = 0; i < q; i++) {
        int l, r;
        cin >> l >> r;
        qr[l - 1].push_back({r - 1, i});
    }

    // for (int i = 0; i < n; i++) {
    //     for (auto p : ev[i]) {
    //         cout << p.first + 1 << " " << p.second + 1 << "\n";
    //     }
    // }


    for (int i = n - 1; i >= 0; i--) {
        for (auto p : ev[i]) {
            int x = p.second + p.second - p.first,
                val = a[p.first] + a[p.second];
            if (x >= n)
                continue;
            if (prev(st.lower_bound({x + 1, -1}))->second < val) {
                auto it = st.lower_bound({x, -1});
                while (it->second <= val) {
                    it++;
                    st.erase(prev(it));
                }
                upd(x, it->first - 1, val, 1, 0, n - 1);
                st.insert(make_pair(x, val));
            }
        }

        for (auto p : qr[i]) {
            ans[p.second] = que(i, p.first, 1, 0, n - 1);
        }

        // for (auto p : st) {
        //     cout << p.first + 1 << " " << p.second << "\n";
        // }
        // cout << que(3, 3, 1, 0, n - 1) << "\n";
        // cout << "\n";
    }

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

 
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 23 ms 23928 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 24 ms 23932 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 23 ms 23928 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 24 ms 23932 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 371 ms 42348 KB Output is correct
12 Correct 375 ms 42272 KB Output is correct
13 Correct 402 ms 42512 KB Output is correct
14 Correct 371 ms 42360 KB Output is correct
15 Correct 372 ms 42436 KB Output is correct
16 Correct 380 ms 41632 KB Output is correct
17 Correct 368 ms 41900 KB Output is correct
18 Correct 373 ms 41820 KB Output is correct
19 Correct 368 ms 42480 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 42140 KB Output is correct
2 Correct 279 ms 51036 KB Output is correct
3 Correct 153 ms 41712 KB Output is correct
4 Correct 256 ms 42132 KB Output is correct
5 Correct 265 ms 42232 KB Output is correct
6 Correct 246 ms 41564 KB Output is correct
7 Correct 246 ms 41308 KB Output is correct
8 Correct 248 ms 41424 KB Output is correct
9 Correct 250 ms 41828 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 23 ms 23928 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 24 ms 23932 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 371 ms 42348 KB Output is correct
12 Correct 375 ms 42272 KB Output is correct
13 Correct 402 ms 42512 KB Output is correct
14 Correct 371 ms 42360 KB Output is correct
15 Correct 372 ms 42436 KB Output is correct
16 Correct 380 ms 41632 KB Output is correct
17 Correct 368 ms 41900 KB Output is correct
18 Correct 373 ms 41820 KB Output is correct
19 Correct 368 ms 42480 KB Output is correct
20 Correct 255 ms 42140 KB Output is correct
21 Correct 279 ms 51036 KB Output is correct
22 Correct 153 ms 41712 KB Output is correct
23 Correct 256 ms 42132 KB Output is correct
24 Correct 265 ms 42232 KB Output is correct
25 Correct 246 ms 41564 KB Output is correct
26 Correct 246 ms 41308 KB Output is correct
27 Correct 248 ms 41424 KB Output is correct
28 Correct 250 ms 41828 KB Output is correct
29 Correct 1392 ms 89664 KB Output is correct
30 Correct 1423 ms 111988 KB Output is correct
31 Correct 1283 ms 88680 KB Output is correct
32 Correct 1414 ms 89876 KB Output is correct
33 Correct 1413 ms 89700 KB Output is correct
34 Correct 1358 ms 87544 KB Output is correct
35 Correct 1366 ms 87164 KB Output is correct
36 Correct 1377 ms 87200 KB Output is correct
37 Correct 1413 ms 88568 KB Output is correct
38 Correct 1024 ms 95480 KB Output is correct
39 Correct 1053 ms 95480 KB Output is correct
40 Correct 1010 ms 92120 KB Output is correct
41 Correct 1000 ms 91608 KB Output is correct
42 Correct 999 ms 91544 KB Output is correct
43 Correct 1016 ms 93284 KB Output is correct
44 Correct 1094 ms 94656 KB Output is correct
45 Correct 1088 ms 94924 KB Output is correct
46 Correct 1071 ms 91640 KB Output is correct
47 Correct 1085 ms 91152 KB Output is correct
48 Correct 1067 ms 91236 KB Output is correct
49 Correct 1081 ms 93376 KB Output is correct
50 Correct 1161 ms 93020 KB Output is correct
51 Correct 1232 ms 92944 KB Output is correct
52 Correct 1163 ms 90488 KB Output is correct
53 Correct 1151 ms 90140 KB Output is correct
54 Correct 1167 ms 90204 KB Output is correct
55 Correct 1178 ms 91644 KB Output is correct