Submission #122450

#	Time	Username	Problem	Language	Result	Execution time	Memory
122450		eohomegrownapps	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	3 ms	384 KiB

boxes

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

long long delivery(int N, int K, int L, int p[]) {
    vector<ll> dp(N,0);
    for (ll i = 0; i<N; i++){
        ll minval = -1;
        for (ll j = max((i-K+1),0LL); j<=i; j++){
            //from j to i inclusive.
            ll val = min(min((L-p[j])*2,(p[j]+L-p[i])*2),min(L,p[i]*2));
            if (j>0){
                val+=dp[j-1];
            }
            if (minval==-1||minval>val){
                minval=val;
            }
        }
        dp[i]=minval;
        //cout<<dp[i]<<endl;
    }
    return dp[N-1];
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30