Submission #544125

#	Time	Username	Problem	Language	Result	Execution time	Memory
544125		krit3379	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	553 ms	293732 KiB

boxes

#include<bits/stdc++.h>
using namespace std;
#define N 10000005

long long dp1[N],dp2[N],ans=1e18;

long long delivery(int n,int k,int l,int pos[N]){
    int i;
    for(i=1;i<=n;i++)dp1[i]=dp1[max(0,i-k)]+pos[i-1]+min(pos[i-1],l-pos[i-1]);
    for(i=n;i>0;i--)dp2[i]=dp2[min(n+1,i+k)]+l-pos[i-1]+min(pos[i-1],l-pos[i-1]);
    for(i=0;i<=n;i++)ans=min(ans,dp1[i]+dp2[i+1]);
    return ans;
}

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