# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
272745 | toonewbie | Boxes with souvenirs (IOI15_boxes) | C++17 | 635 ms | 293932 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;
const int N = 10000005;
long long pref[N], suff[N];
long long delivery(int N, int K, int L, int p[]) {
for (int i = 0; i < N; i++) {
pref[i] = (i - K >= -1 ? pref[i - K] + p[i] : p[i]) + min(p[i], L - p[i]);
}
for (int i = N - 1; i >= 0; i--) {
suff[i] = (i + K <= N ? suff[i + K] + L - p[i] : L - p[i]) + min(p[i], L - p[i]);
}
long long res = 2000000000000000000;
for (int i = -1; i < N; i++) {
res = min(res, pref[i] + suff[i + 1]);
}
return res;
}
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... |