| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1285252 | AndriaBeridze | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
#include "boxes.h"
long long delivery(int N, int K, int L, int p[]) {
vector<pair<int, int>> v;
for (int i = 0; i < N; i++) {
if (p[i] > L / 2) {
v.push_back({ L - p[i], 1 });
} else {
v.push_back({ p[i], 0 });
}
}
sort(v.rbegin(), v.rend());
vector<int> l, r;
for (int i = 0; i < N; i++) (v[i].second ? r : l).push_back(v[i].first);
vector<long long> dpl((int) l.size() + 1, 0), dpr((int) r.size() + 1, 0);
for (int i = (int) l.size() - 1; i >= 0; i--) {
dpl[i] = l[i] * 2;
if (i + K < size(l)) dpl[i] += dpl[i + K];
}
for (int i = (int) r.size() - 1; i >= 0; i--) {
dpr[i] = r[i] * 2;
if (i + K < size(r)) dpr[i] += dpr[i + K];
}
// for (int x : dpr) cout << x << ' ';
// cout << endl;
long long ans = (long long) 1e18;
int cl, cr; cl = cr = 0;
for (int i = 0; i < N; i++) {
if (i % K == 0) {
ans = min(ans, i / K * L + dpl[cl] + dpr[cr]);
// cout << i << ' ' << i / K << ' ' << dpl[cl] << ' ' << dpr[cr] << endl;
}
if (v[i].second) cr++;
else cl++;
}
return ans;
}
