oj.uz

Submission #655544

# Submission time Handle Problem Language Result Execution time Memory
655544 2022-11-04T16:56:51 Z piOOE Triple Jump (JOI19_jumps) C++17
100 / 100
 1223 ms 45448 KB 
#include <bits/stdc++.h>

using namespace std;

struct Info {
    int add = 0, a = 0, ans = 0;
};

Info operator+(Info a, Info b) {
    return {max(a.add, b.add), max(a.a, b.a), max({a.ans, b.ans, a.add + b.a})};
}

int sz = 1;
vector<Info> t;

void init(int n, vector<int> a) {
    sz = 1 << (__lg(n) + bool(n & (n - 1)));
    t.assign(sz << 1, {});
    for (int i = 0; i < n; ++i) {
        t[i + sz].a = t[i + sz].ans = a[i];
    }
    for (int i = sz - 1; i > 0; --i) {
        t[i] = t[i << 1] + t[i << 1 | 1];
    }
}

Info rangeQuery(int l, int r, int x = 1, int lx = 0, int rx = sz) {
    if (l >= rx || lx >= r) {
        return {};
    }
    if (l <= lx && rx <= r) {
        return t[x];
    }
    int mid = (lx + rx) >> 1;
    return rangeQuery(l, r, x << 1, lx, mid) + rangeQuery(l, r, x << 1 | 1, mid, rx);
}

void modify(int i, int add) {
    i += sz;
    t[i].add = max(t[i].add, add);
    t[i].ans = t[i].add + t[i].a;
    while (i >>= 1) {
        t[i] = t[i << 1] + t[i << 1 | 1];
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

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

    vector<array<int, 3>> events;

    auto relax = [&](int i, int j) {
        int r = j + (j - i);
        if (r < n) {
            events.push_back({i, j, -1});
        }
    };

    vector<int> stk;
    for (int i = 0; i < n; ++i) {
        while (!stk.empty() && a[stk.back()] <= a[i]) {
            relax(stk.back(), i);
            stk.pop_back();
        }
        if (!stk.empty()) {
            relax(stk.back(), i);
        }
        stk.push_back(i);
    }

    int q;
    cin >> q;

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

    vector<int> ans(q);

    sort(events.begin(), events.end(), [&](array<int, 3> x, array<int, 3> y) {
        return x[0] != y[0] ? x[0] > y[0] : x[2] < y[2];
    });

    init(n, a);

    set<array<int, 3>> st;

    for (auto [i, j, tp]: events) {
        if (tp > -1) {
            ans[tp] = rangeQuery(i, j).ans;
        } else {
            int k = j + (j - i);
            int sum = a[i] + a[j];
            modify(k, sum);
        }
    }

    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 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 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 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 494 ms 17516 KB Output is correct
12 Correct 522 ms 15940 KB Output is correct
13 Correct 473 ms 16044 KB Output is correct
14 Correct 536 ms 16088 KB Output is correct
15 Correct 511 ms 16116 KB Output is correct
16 Correct 508 ms 15348 KB Output is correct
17 Correct 509 ms 17172 KB Output is correct
18 Correct 508 ms 17012 KB Output is correct
19 Correct 510 ms 17712 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 14372 KB Output is correct
2 Correct 95 ms 12104 KB Output is correct
3 Correct 100 ms 13168 KB Output is correct
4 Correct 146 ms 14492 KB Output is correct
5 Correct 137 ms 14484 KB Output is correct
6 Correct 128 ms 13868 KB Output is correct
7 Correct 145 ms 13696 KB Output is correct
8 Correct 134 ms 13728 KB Output is correct
9 Correct 131 ms 14056 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 494 ms 17516 KB Output is correct
12 Correct 522 ms 15940 KB Output is correct
13 Correct 473 ms 16044 KB Output is correct
14 Correct 536 ms 16088 KB Output is correct
15 Correct 511 ms 16116 KB Output is correct
16 Correct 508 ms 15348 KB Output is correct
17 Correct 509 ms 17172 KB Output is correct
18 Correct 508 ms 17012 KB Output is correct
19 Correct 510 ms 17712 KB Output is correct
20 Correct 147 ms 14372 KB Output is correct
21 Correct 95 ms 12104 KB Output is correct
22 Correct 100 ms 13168 KB Output is correct
23 Correct 146 ms 14492 KB Output is correct
24 Correct 137 ms 14484 KB Output is correct
25 Correct 128 ms 13868 KB Output is correct
26 Correct 145 ms 13696 KB Output is correct
27 Correct 134 ms 13728 KB Output is correct
28 Correct 131 ms 14056 KB Output is correct
29 Correct 1112 ms 45416 KB Output is correct
30 Correct 985 ms 39416 KB Output is correct
31 Correct 981 ms 41480 KB Output is correct
32 Correct 1127 ms 45448 KB Output is correct
33 Correct 1223 ms 45412 KB Output is correct
34 Correct 1198 ms 44636 KB Output is correct
35 Correct 1180 ms 43996 KB Output is correct
36 Correct 1218 ms 43996 KB Output is correct
37 Correct 1173 ms 44624 KB Output is correct
38 Correct 915 ms 44400 KB Output is correct
39 Correct 909 ms 44396 KB Output is correct
40 Correct 878 ms 43104 KB Output is correct
41 Correct 896 ms 42888 KB Output is correct
42 Correct 907 ms 42824 KB Output is correct
43 Correct 896 ms 43744 KB Output is correct
44 Correct 961 ms 44392 KB Output is correct
45 Correct 965 ms 44396 KB Output is correct
46 Correct 980 ms 43240 KB Output is correct
47 Correct 982 ms 43068 KB Output is correct
48 Correct 980 ms 43112 KB Output is correct
49 Correct 994 ms 44260 KB Output is correct
50 Correct 1053 ms 44396 KB Output is correct
51 Correct 1027 ms 44268 KB Output is correct
52 Correct 1027 ms 43612 KB Output is correct
53 Correct 1010 ms 43688 KB Output is correct
54 Correct 973 ms 43548 KB Output is correct
55 Correct 975 ms 44344 KB Output is correct