Submission #1006689

#	Time	Username	Problem	Language	Result	Execution time	Memory
1006689		The_Samurai	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	348 KiB

boxes

#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

ll delivery(int n, int k, int L, int p[]) {
    auto dist = [&](int i, int j) -> int {
        return min(abs(i - j), L - abs(i - j));  
    };
    sort(p, p + n);
    vector<ll> pref(n), suff(n + 1);
    int left = 0;
    bool nw = true;
    for (int i = 0; i < n; i++) {
        pref[i] = i > 0 ? pref[i - 1] : 0;
        if (left == 0) {
            left = k;
            nw = true;
        }
        pref[i] += dist(nw ? 0 : p[i - 1], p[i]) * 2;
        left--;
        nw = false;
    }
    left = 0;
    for (int i = n - 1; i >= 0; i--) {
        suff[i] = suff[i + 1];
        if (left == 0) {
            left = k;
            nw = true;
        }
        suff[i] += dist(nw ? 0 : p[i + 1], p[i]) * 2;
        left--;
        nw = false;
    }
    ll ans = min(pref[n - 1], suff[0]);
    for (int i = 1; i < n; i++) {
        ans = min(ans, pref[i - 1] + suff[i]);
    }
    return ans;
}

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