# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1007095 | The_Samurai | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 += k) {
for (int j = i; j < min(n, i + k); j++) {
pref[j] = i > 0 ? pref[i - 1] : 0;
pref[j] += p[j] + dist(0, p[j]);
}
}
for (int i = n - 1; i >= 0; i -= k) {
for (int j = i; j >= max(0, i - k + 1); j--) {
suff[j] = suff[j + 1];
suff[j] += (L - p[j]) + dist(0, p[j]);
}
}
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;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |