oj.uz

Submission #655410

# Submission time Handle Problem Language Result Execution time Memory
655410 2022-11-04T09:41:33 Z piOOE Triple Jump (JOI19_jumps) C++17
5 / 100
 4000 ms 15072 KB 
#include <bits/stdc++.h>

using namespace std;

constexpr int inf = 1e9 + 7;

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];
    }

    auto func = [&](int i, int j) {
        return a[i] > a[j] ? i : j;
    };

    const int max_log = __lg(n) + bool(n & (n - 1));
    vector<vector<int>> st(max_log);
    st[0].resize(n);
    iota(st[0].begin(), st[0].end(), 0);
    for (int i = 1; i < max_log; ++i) {
        st[i].resize(n - (1 << i) + 1);
        for (int j = 0; j < (int) st[i].size(); ++j) {
            st[i][j] = func(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
        }
    }

    vector<int> logn(n + 1);
    for (int i = 2; i <= n; ++i) {
        logn[i] = logn[i >> 1] + 1;
    }

    auto query = [&](int l, int r) {
        int lg = logn[r - l];
        return func(st[lg][l], st[lg][r - (1 << lg)]);
    };

    auto comp = [&](array<int, 3> x, array<int, 3> y) {
        return a[x[0]] > a[y[0]];
    };

    int q;
    cin >> q;
    while (q--) {
        int l, r;
        cin >> l >> r;
        --l;
        vector<int> p;
        set<array<int, 3>, greater<>> pq;
        pq.insert({a[query(l, r)], l, r});
        for (int t = 1; t <= 25 && !pq.empty(); ++t) {
            auto [val, L, R] = *pq.begin();
            pq.erase(pq.begin());
            int i = query(L, R);
            p.push_back(i);
            if (L < i) {
                pq.insert({a[query(L, i)], L, i});
            }
            if (i + 1 < R) {
                pq.insert({a[query(i + 1, R)], i + 1, R});
            }
            while (pq.size() > 25) pq.erase(prev(pq.end()));
        }

        int ans = 0;

        auto relax = [&](int i, int j) {
            int R = j + (j - i);
            if (R < r) {
                ans = max(ans, a[i] + a[j] + a[query(R, r)]);
            }
            int len = j - i - 1;
            if (len > 0) {
                ans = max(ans, a[i] + a[j] + a[query(i + 1, i + 1 + ((len + 1) / 2))]);
            }
            int L = max(l, i - (j - i));
            if (L < i) {
                ans = max(ans, a[i] + a[j] + a[query(L, i)]);
            }
        };

        sort(p.begin(), p.end());

        vector<int> stk;
        for (int i : p) {
            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);
        }

        cout << ans << '\n';
    }

    return 0;
}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:44:10: warning: variable 'comp' set but not used [-Wunused-but-set-variable]
   44 |     auto comp = [&](array<int, 3> x, array<int, 3> y) {
      |          ^~~~

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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 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 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 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 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3799 ms 6728 KB Output is correct
12 Correct 1151 ms 10216 KB Output is correct
13 Correct 1167 ms 10260 KB Output is correct
14 Correct 3952 ms 10324 KB Output is correct
15 Execution timed out 4006 ms 10372 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 15072 KB Output is correct
2 Correct 26 ms 14928 KB Output is correct
3 Correct 25 ms 14924 KB Output is correct
4 Correct 25 ms 14944 KB Output is correct
5 Correct 26 ms 14936 KB Output is correct
6 Incorrect 22 ms 14932 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 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 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3799 ms 6728 KB Output is correct
12 Correct 1151 ms 10216 KB Output is correct
13 Correct 1167 ms 10260 KB Output is correct
14 Correct 3952 ms 10324 KB Output is correct
15 Execution timed out 4006 ms 10372 KB Time limit exceeded
16 Halted 0 ms 0 KB -