Submission #773467

#	Time	Username	Problem	Language	Result	Execution time	Memory
773467		Jomnoi	Shortcut (IOI16_shortcut)	C++17	31 / 100	2054 ms	47284 KiB

shortcut

#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 = 0; k <= i - 1; k++) {
                for (int l = k + 1; l <= i; l++) max_dist = max(max_dist, qsl[l] - qsl[k] + d[k] + d[l]);
            }
            for (int k = i + 1; k <= j - 2; 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]);
            }
            for (int k = j; k <= n - 2; k++) {
                for (int l = k + 1; l <= n - 1; l++) max_dist = max(max_dist, qsl[l] - qsl[k] + d[k] + d[l]);
            }
            
            // cout << i << ' ' << j << ' ' << max_dist << endl;

            ans = min(ans, max_dist);
        }
    }
    return ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 14 / 14
• Subtask 3: 8 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3