제출 #1020581

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1020581		vjudge1	Shortcut (IOI16_shortcut)	C++17	31 / 100	2005 ms	604 KiB

shortcut

#include <bits/stdc++.h>
#define ent '\n'

typedef long long ll;
using namespace std;
const int maxn = 2e5+12;

ll pref[maxn];
int n;

long long find_shortcut(int N, vector <int> l, vector <int> d, int c){
    n = N;
    for(int i=1;i<n;i++){
        pref[i] = pref[i-1] + l[i-1];
    }
    ll ans = 1e18;
    for(int x=0;x<n;x++){
        for(int y=x+1;y<n;y++){
            ll val = *max_element(d.begin(), d.end()), mn = 0;
            ll mxl = 0, mxr = 0;
            for(int i=0;i<=x;i++) {
                if(i != x) mxl = max(mxl, pref[x] - pref[i] + d[i]);
                val = max(val, pref[i] + d[i] + mn);
                mn = max(mn, d[i] - pref[i]);
            }
            mn = -pref[y];
            for(int i=y;i<n;i++){
                if(i != y) mxr = max(mxr, pref[i] - pref[y] + d[i]);
                val = max(val, pref[i] + d[i] + mn);
                mn = max(mn, d[i] - pref[i]);
            }
            val = max(val, mxl + mxr + min(pref[y] - pref[x], (ll)c));
            for(int i=x;i<=y;i++){
                val = max(val, mxl + min(pref[i] - pref[x], pref[y] - pref[i] + c) + d[i]);
                val = max(val, mxr + min(pref[y] - pref[i], pref[i] - pref[x] + c) + d[i]);
                for(int j=i+1;j<=y;j++){
                    val = max(val, min(pref[j] - pref[i], pref[i] - pref[x] + pref[y] - pref[j] + c) + d[i] + d[j]);
                }
            }
            ans = min(ans, val);
        }
    }
    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