Submission #595179

#	Time	Username	Problem	Language	Result	Execution time	Memory
595179		KrisjanisP	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	494 ms	259672 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define INF 1e18
using namespace std;
using ll = long long;

long long delivery(int N, int K, int L, int p[]) {
    ll l[N+1], r[N+1];
    l[0] = r[0] = 0;
    for(ll i=1;i<=N;i++)
    {
        l[i] = l[max(i-K,0ll)]+p[i-1]*2;
        r[i] = r[max(i-K,0ll)]+(L-p[N-i])*2;
    }
    ll res = INF;
    for(ll tl=0;tl<=N;tl++)
    {
        ll tr = N-tl;
        res = min(res,l[tl]+r[tr]);
        ll tr2 = max(N-tl-K,0ll);
        res = min(res,l[tl]+r[tr2]+L);
    }
    return res;
}

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