제출 #1253388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253388		antonn	Shortcut (IOI16_shortcut)	C++20	0 / 100	1 ms	328 KiB

shortcut

#include "shortcut.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

template<typename T>
bool assign_min(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool assign_max(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

vector<ll> sum;

ll get_sum(int l, int r) {
    return sum[r] - (l == 0 ? 0 : sum[l - 1]);
}

ll find_shortcut(int n, vector<int> l, vector<int> d, int c) {
    sum.resize(n + 1);
    for (int i = 0; i < n; i++) {
        sum[i] = (i == 0 ? 0 : sum[i - 1]) + l[i];
    }
    vector<ll> far_left(n + 2);
    vector<ll> far_right(n + 2);
    far_left[1] = d[0];
    for (int i = 2; i <= n; i++) {
        far_left[i] = max(far_left[i - 1] + l[i - 2], (ll) d[i - 1]);
    }
    far_right[n] = d[n - 1];
    for (int i = n - 1; i >= 1; i--) {
        far_right[i] = max(far_right[i + 1] + l[i - 1], (ll) d[i - 1]);
    }
    vector<ll> pref(n + 2), suff(n + 2);
    pref[1] = d[0];
    ll far = d[0];
    for (int i = 2; i <= n; i++) {
        pref[i] = max(pref[i - 1], l[i - 2] + far + d[i - 1]);
        far = max(far, far + l[i - 2]);
        far = max(far, (ll) d[i - 1]);
    }
    suff[n] = d[n - 1];
    far = d[n - 1];
    for (int i = n - 1; i >= 1; i--) {
        suff[i] = max(suff[i + 1], l[i - 1] + far + d[i - 1]);
        far = max(far, far + l[i - 1]);
        far = max(far, (ll) d[i - 1]);
    }
    ll ans = pref[n];
    for (int i = 1; i <= n; i++) {
        ll inside = 0, far = 0;
        for (int j = i + 1; j <= n; j++) {
            ll diam = 0;
            diam = max(pref[i], suff[j]);
            diam = max(diam, inside);
            diam = max(diam, far_left[i] + c + far_right[j]);
            for (int k = i + 1; k <= j - 1; k++) {
                diam = max(diam, far_right[j] + d[k - 1] + min(get_sum(k - 1, j - 2), get_sum(i - 1, k - 2) + c));
                diam = max(diam, far_left[i] + d[k - 1] + min(get_sum(k - 1, j - 2) + c, get_sum(i - 1, k - 2)));
            }
            ans = min(ans, diam);
            if (j == i + 1) {
                inside = d[j - 1];
                far = d[j - 1];
            } else {
                inside = max(inside, far + l[j - 2] + d[j - 1]);
                far = max(far, far + l[j - 2]);
                far = max(far, (ll) d[j - 1]);
            }
        }
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

shortcut.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
shortcut_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• 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