Submission #813222

#	Time	Username	Problem	Language	Result	Execution time	Memory
813222		Kerim	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	443 ms	235156 KiB

boxes

#include "boxes.h"
#include "bits/stdc++.h"
 
using namespace std;
#define ll long long
 
int f(int n, int k){
    return (n+k-1) / k;
}
long long delivery(int n, int k, int l, int p[]) {
    vector<int> arr(n+2);
    arr[n+1] = l;
    for (int i = 1; i <= n; i++)
        arr[i] = p[i-1];
    vector<ll> pref(n+2), suf(n+2);
    for (int i = 1; i <= n; i++){
        pref[i] = arr[i];
        if (i >= k)
            pref[i] += pref[i-k];
    }
    for (int i = n; i >= 1; i--){
        suf[i] = l - arr[i];
        if (i + k <= n)
            suf[i] += suf[i+k];
    }
    ll answer = f(n, k) * 1LL * l;
    for (int i = 0; i <= n; i++)
        answer = min(answer, 2*(pref[i] + suf[i+1]));
    for (int i = 0; i <= n; i++)
        if (k+1+i <= n+1)
            answer = min(answer, l + 2*(pref[i] + suf[k+1+i]));
    return answer;
}

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