Submission #666312

#	Time	Username	Problem	Language	Result	Execution time	Memory
666312		jamezzz	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	943 ms	151896 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
 
#define LINF 1023456789123456789
typedef long long ll;
#define maxn 10000005
 
ll pfx[maxn], sfx[maxn];
 
ll delivery(int N, int K, int L, int p[]){
    sort(p, p + N);
    for (int i = 0; i < N; ++i) {
        sfx[i % K] += min(L, 2 * (L - p[i]));
    }
    ll ans = sfx[0];
    for (int i = 0; i < N; ++i) {
        pfx[i % K] += min(L, 2 * p[i]);
        sfx[i % K] -= min(L, 2 * (L - p[i]));
        ans = min(ans, pfx[i % K] + sfx[(i + 1) % K]);
    }
    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