oj.uz

Submission #773462

# Submission time Handle Problem Language Result Execution time Memory
773462 2023-07-05T05:38:07 Z Jomnoi Shortcut (IOI16_shortcut) C++17
0 / 100
 26 ms 47188 KB 
#include <bits/stdc++.h>
#include "shortcut.h"
using namespace std;

const int MAX_N = 1e6 + 5;
const long long INF = 1e18 + 7;

int n;
multiset <pair <int, int>> graph[MAX_N];
long long qsl[MAX_N];

long long find_shortcut(int n, vector <int> l, vector <int> d, int c) {
    ::n = n;
    for (int i = 1; i < n; i++) qsl[i] = qsl[i - 1] + l[i - 1];

    long long ans = INF;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            long long maxleft = 0, maxright = 0;
            for (int k = i; k >= 0; k--) maxleft = max(maxleft, qsl[i] - qsl[k] + d[k]);
            for (int k = j; k < n; k++) maxright = max(maxright, qsl[k] - qsl[j] + d[k]);

            long long max_dist = maxleft + maxright + min(qsl[j] - qsl[i], 1ll * c);
            for (int k = i + 1; k <= j - 1; k++) {
                max_dist = max(max_dist, maxleft + min(qsl[k] - qsl[i], qsl[j] - qsl[k] + c) + d[k]);
                max_dist = max(max_dist, maxright + min(qsl[j] - qsl[k], qsl[k] - qsl[i] + c) + d[k]);
            }
            for (int k = i + 1; k < j - 1; k++) {
                for (int l = k + 1; l <= j - 1; l++) max_dist = max(max_dist, min(qsl[l] - qsl[k], qsl[k] - qsl[i] + qsl[j] - qsl[l] + c) + d[k] + d[l]);
            }
            ans = min(ans, max_dist);
        }
    }
    return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47188 KB n = 4, 80 is a correct answer
2 Incorrect 26 ms 47144 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47188 KB n = 4, 80 is a correct answer
2 Incorrect 26 ms 47144 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47188 KB n = 4, 80 is a correct answer
2 Incorrect 26 ms 47144 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47188 KB n = 4, 80 is a correct answer
2 Incorrect 26 ms 47144 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47188 KB n = 4, 80 is a correct answer
2 Incorrect 26 ms 47144 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47188 KB n = 4, 80 is a correct answer
2 Incorrect 26 ms 47144 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47188 KB n = 4, 80 is a correct answer
2 Incorrect 26 ms 47144 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47188 KB n = 4, 80 is a correct answer
2 Incorrect 26 ms 47144 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -