Submission #832358

#	Time	Username	Problem	Language	Result	Execution time	Memory
832358		ttamx	선물상자 (IOI15_boxes)	C++14	100 / 100	483 ms	227700 KiB

boxes

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

using namespace std;

typedef long long ll;

ll delivery(int N, int K, int L, int p[]) {
    vector<ll> dpl(N+2),dpr(N+2);
    for(int i=1;i<=N;i++)dpl[i]=dpl[max(0,i-K)]+min(2*p[i-1],L);
    for(int i=N;i>=1;i--)dpr[i]=dpr[min(N+1,i+K)]+min(2*(L-p[i-1]),L);
    ll ans=LLONG_MAX;
    for(int i=0;i<=N;i++)ans=min(ans,dpl[i]+dpr[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