Submission #831389

#	Time	Username	Problem	Language	Result	Execution time	Memory
831389		OrazB	Shortcut (IOI16_shortcut)	C++14	0 / 100	0 ms	212 KiB

shortcut

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

const int N = 1e5+5;
ll pref[N], suff[N];

ll find_shortcut(int n, vector<int> l, vector<int> d, int c){
    for (int i = 0; i < n; i++){
        ll sum = 0;
        pref[i] = suff[i] = d[i];
        for (int j = i-1; j >= 0; j--){
            sum += l[j];
            pref[i] = max(pref[i], sum+d[j]); 
        }
        sum = l[i];
        for (int j = i+1; j < n; j++){
            suff[i] = max(suff[i], sum+d[j]);
            if (j == n-1) break;
            sum += l[j];
        }
    }
    ll mn = 1e18;
    for (int i = 0; i < n; i++){
        for (int j = i+1; j < n; j++){
            mn = min(mn, pref[i]+suff[j]+c);
        }
    }
    return mn;
}

• 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