Submission #1098873

#	Time	Username	Problem	Language	Result	Execution time	Memory
1098873		alexander_707070	Boxes with souvenirs (IOI15_boxes)	C++14	25 / 100	2 ms	348 KiB

boxes

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

#define MAXN 200007
using namespace std;

const long long inf=1e17;

int n,k,L;
int team[MAXN];
long long dp[MAXN];

int cost(int l,int r){
    int a=min(team[l],L-team[r]);
    int c=team[r]-team[l];

    return min(2*(a+c),L);
}

long long delivery(int N, int K, int LL,int p[]) {
    n=N; k=K; L=LL;

    for(int i=1;i<=n;i++){
        team[i]=p[i-1];
    }

    sort(team+1,team+n+1);

    for(int i=1;i<=n;i++){
        dp[i]=inf;
        for(int f=i;f>=i-k+1;f--){
            dp[i]=min(dp[i],dp[f-1]+cost(f,i));
        }
    }

    if(n<=k)dp[n]=min(dp[n],L+0LL);

    return dp[n];
}

/*int main(){

    cout<<delivery(3,2,8,{1,2,5})<<"\n";

	return 0;
}*/

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