Submission #681242

#	Time	Username	Problem	Language	Result	Execution time	Memory
681242		speedyArda	선물상자 (IOI15_boxes)	C++14	100 / 100	512 ms	293656 KiB

boxes

#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int MAXN = 1e7+5;
ll dp_cw[MAXN], dp_acw[MAXN];
long long delivery(int N, int K, int L, int p[]) {
    ll ans = 1e18;
    for(int i=1;i<=K;i++)dp_cw[i] = p[i-1] * 2;
    for(int i=K+1;i<=N;i++)dp_cw[i] = dp_cw[i-K] + p[i-1] * 2;
    for(int i=N;i>=N-K+1;i--)dp_acw[i] = (L - p[i-1])*2;
    for(int i=N-K;i>=1;i--)dp_acw[i] = dp_acw[i+K] + (L - p[i-1]) * 2;
    dp_acw[N+1] = 0;
    for(int i = 0; i <= N; i++)
    {
        ans = min(ans, dp_cw[i] + dp_acw[i+1]);
    }
    
    for(int i = K; i <= N; i++)
        ans = min(ans, dp_cw[i - K] + dp_acw[i + 1] + L);
   

    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