Submission #681224

#	Time	Username	Problem	Language	Result	Execution time	Memory
681224		speedyArda	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	340 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 = 0; i < N; i++)
    {
        ll base = 0;
        if(i - K >= 0)
            base = dp_cw[i - K];
        if(p[i] <= L / 2)
            dp_cw[i] = base + p[i] * 2LL;
        else
            dp_cw[i] = base + L;
    }

    for(int i = N - 1; i >= 0; i--)
    {
        ll base = 0;
        if(i + K < N)
            base = dp_acw[i + K];
        if(p[i] >= (L+1) / 2)
            dp_acw[i] = base + (L - p[i]) * 2LL;
        else
            dp_acw[i] = base + L;
    }
    
    for(int i = 0; i < N - 1; i++)
    {
        ans = min(ans, dp_cw[i] + dp_acw[i+1]);
    }
    
    for(int i = N - 1; i > 0; i--)
        ans = min(ans, dp_cw[i - 1] + dp_acw[i]);
   

    return ans;
}

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