Submission #611729

#	Time	Username	Problem	Language	Result	Execution time	Memory
611729		PiejanVDC	Shortcut (IOI16_shortcut)	C++17	0 / 100	1 ms	212 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
 
long long find_shortcut(int n, vector<int>l, vector<int>d, int c) {
    long long le[n], re[n], lee[n], ree[n];
    lee[0] = ree[n-1] = 0;
    re[n-1] = d[n-1];
    le[0] = d[0];
    for(int i = 1 ; i < n ; i++) {
        le[i] = max(le[i-1]+(long long)l[i-1], (long long)d[i]), lee[i] = le[i-1]+l[i-1];
    }
    for(int j = n-2 ; j >= 0 ; j--) {
        re[j] = max(re[j+1] + (long long)l[j], (long long)d[j]), ree[j] = re[j+1] + l[j];
    }

    long long mn = (long long)1e18;

    for(int i = 0 ; i < n ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            long long x = -1;
            for(int k = i+1 ; k < j ; k++) {
                //cout << i << ' ' << j << ' ' << k << '\n';
                x = max(x, lee[k]+d[k]);
                x = max(x, ree[k]+d[k]);
                //cout << lee[k] << ' ' << ree[k] << '\n'; 
                x = max(x, le[i]+re[j]+c);
                //cout << mn << '\n';
            }
            if(x > -1)
                mn = min(mn, x);
        }
    }
    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