oj.uz

Submission #146034

# Submission time Handle Problem Language Result Execution time Memory
146034 2019-08-21T16:14:18 Z fedoseevtimofey Triple Jump (JOI19_jumps) C++14
0 / 100
 4000 ms 4884 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

bool ok(int i, int j, int k) {
    vector <int> r = {i, j, k};
    sort(r.begin(), r.end());
    i = r[0], j = r[1], k = r[2];
    if (i == j || j == k) return false;
    return k - j >= j - i;
}

int solve(vector <int> a) {
    vector <pair <int, int>> b;
    int n = a.size();
    for (int i = 0; i < n; ++i) b.push_back({a[i], i});
    sort(b.rbegin(), b.rend());
    int ans = 0;
    for (int i = 0; i < min((int)b.size(), 3); ++i) {
        for (int j = 0; j < n; ++j) {
            for (int k = 0; k < n; ++k) {
                if (ok(b[i].second, j, k)) {
                    ans = max(ans, b[i].first + a[j] + a[k]);
                }
            }
        }   
    }   
    return ans;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    int n;
    cin >> n;
    vector <int> A(n);
    for (int i = 0; i < n; ++i) {
        cin >> A[i];
    }
    int q;
    cin >> q;
    while (q--) {
        int l, r;
        cin >> l >> r;
        --l, --r;
        vector <int> a;
        for (int i = l; i <= r; ++i) a.push_back(A[i]);
        cout << solve(a) << '\n';
    }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 31 ms 380 KB Output is correct
3 Correct 32 ms 376 KB Output is correct
4 Correct 28 ms 376 KB Output is correct
5 Correct 26 ms 376 KB Output is correct
6 Incorrect 29 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 31 ms 380 KB Output is correct
3 Correct 32 ms 376 KB Output is correct
4 Correct 28 ms 376 KB Output is correct
5 Correct 26 ms 376 KB Output is correct
6 Incorrect 29 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4022 ms 4884 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 31 ms 380 KB Output is correct
3 Correct 32 ms 376 KB Output is correct
4 Correct 28 ms 376 KB Output is correct
5 Correct 26 ms 376 KB Output is correct
6 Incorrect 29 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -