Submission #639896

#	Time	Username	Problem	Language	Result	Execution time	Memory
639896		piOOE	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	540 ms	262628 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

long long delivery(int n, int k, int l, int p[]) {
    vector<ll> pref(n + 1), suf(n + 1);
    for (int i = 1; i <= n; ++i) {
        int L = max(0, i - k);
        pref[i] = pref[L] + p[i - 1] + min(p[i - 1], l - p[i - 1]);
    }
    for (int i = n - 1; i > -1; --i) {
        int R = min(n, i + k);
        suf[i] = suf[R] + (l - p[i]) + min(p[i], l - p[i]);
    }
    ll ans = numeric_limits<ll>::max();
    for (int i = 0; i <= n; ++i) {
        ans = min(ans, pref[i] + suf[i]);
    }
    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