Submission #154120

#	Time	Username	Problem	Language	Result	Execution time	Memory
154120		popovicirobert	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	3 ms	376 KiB

boxes

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

using namespace std;

const int MAXN = (int) 1e7 + 5; // ???

static ll pref[MAXN + 1], suff[MAXN + 1];

long long delivery(int n, int k, int l, int p[]) {
    int i;

    sort(p, p + n);

    pref[0] = 0;
    for(i = 1; i <= n; i++) {
        pref[i] = pref[max(i - k, 0)] + 2 * p[i - 1];
    }

    suff[n + 1] = 0;
    for(i = n; i >= 1; i--) {
        suff[i] = suff[min(n + 1, i + k)] + 2 * (l - p[i - 1]);
    }

    ll ans = 1e18;
    for(i = 0; i <= n; i++) {
        ans = min(ans, pref[i] + suff[i + 1]);
    }

    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