제출 #773498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
773498		Jomnoi	Shortcut (IOI16_shortcut)	C++17	0 / 100	1 ms	340 KiB

shortcut

#include <bits/stdc++.h>
#include "shortcut.h"
using namespace std;

const int MAX_N = 3005;
const long long INF = 1e18 + 7;

int n;
multiset <pair <int, int>> graph[MAX_N];
long long qsl[MAX_N];
long long preLeft[MAX_N], preRight[MAX_N];
// long long dp1[MAX_N][MAX_N], dp2[MAX_N][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 tmp = -qsl[0] + d[0];
    for (int i = 1; i < n; i++) {
        preLeft[i] = max(preLeft[i - 1], tmp + qsl[i] + d[i]);
        tmp = max(tmp, -qsl[i] + d[i]);
    }
    tmp = qsl[n - 1] + d[n - 1];
    for (int i = n - 2; i >= 0; i--) {
        preRight[i] = max(preRight[i + 1], tmp - qsl[i] + d[i]);
        tmp = max(tmp, qsl[i] + d[i]);
    }

    // for (int i = 0; i <= n - 2; i++) {
    //     for (int j = i + 1; j <= n - 1; j++) {
    //         dp1[i][j] = qsl[j] - qsl[i] + d[i] + d[j];
    //         dp2[i][j] = qsl[i] - qsl[j] + d[i] + d[j] + c;
    //     }
    // }
    // for (int s = 0; s < n; s++) {
    //     for (int i = 0, j = s; j < n; i++, j++) {
    //         dp1[i][j] = max({dp1[i][j], dp1[i - 1][j], dp1[i][j - 1]});
    //         dp2[i][j] = max({dp2[i][j], dp2[i - 1][j], dp2[i][j - 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]);
            }
            long long tmp1 = -qsl[i + 1] + d[i + 1], tmp2 = qsl[i + 1] + d[i + 1];
            for (int k = i + 2; k <= j - 1; k++) {
                max_dist = max(max_dist, d[k] + min(qsl[k] + tmp1, tmp2 - qsl[k] + qsl[j] - qsl[i]));
                // for (int l = k + 1; l <= j - 1; l++) {
                //     max_dist = max(max_dist, d[k] + d[l] + min(qsl[l] - qsl[k], 
                //                                                qsl[k] - qsl[i] + qsl[j] - qsl[l] + c));
                // }
            }
            // 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 = 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]);
            // }

            // max_dist = max(max_dist, min(dp1[i + 1][j - 1], dp2[i + 1][j - 1] + qsl[j] - qsl[i]));
            max_dist = max(max_dist, max(preLeft[i], preRight[j]));
            
            // cout << i << ' ' << j << ' ' << max_dist << endl;

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

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