Submission #1082226

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082226		raphael_heuchl	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	422 ms	137524 KiB

boxes

#include "boxes.h"
#include <iostream>
#define INF 5'000'000'000'000'000'000
#define MIN(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;

ll delivery(int N, int K, int L, int p[])
{
    ll best = INF;
    for (ll i = 0; i < K; ++i)
    {
        ll sum = MIN(0, L - 2*p[0]) + MIN(L, 2*p[i]);
        ll pos = i;

        while (pos < N-1)
            sum += MIN(L - (p[pos+1]<<1), 0),
            pos = MIN(pos+K, N-1),
            sum += MIN(L, p[pos]<<1);
            
        best = MIN(best, sum);
    }

    return best;
}

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