# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218500 | socho | Boxes with souvenirs (IOI15_boxes) | C++14 | 13 ms | 16048 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 long long MXN = 1000005;
long long n, k, l, h, pos[MXN], rpos[MXN];
long long dpleft[MXN];
long long dpright[MXN];
long long delivery(int N, int K, int L, int p[]) {
for (int i=0; i<MXN; i++) {
dpleft[i] = -1;
dpright[i] = -1;
}
n = N;
k = K;
l = L;
h = l/2;
for (int i=0; i<n; i++) {
pos[i] = p[i];
rpos[i] = L - p[i];
}
long long best = LLONG_MAX;
for (int i=0; i<n; i++) {
dpleft[i] = pos[i] * 2;
if (i - k >= 0) dpleft[i] += dpleft[i-k];
}
for (int i=n-1; i>=0; i--) {
dpright[i] = rpos[i] * 2;
if (i + k < n) dpright[i] += dpright[i+k];
}
// for (int i=0; i<n; i++) cout << dpleft[i] << ' '; cout << endl;
// for (int i=0; i<n; i++) cout << dpright[i] << ' '; cout << endl;
for (int i=0; i<n-1; i++) {
best = min(best, dpleft[i] + dpright[i+1]);
}
for (int i=0; i<n-1; i++) {
long long unt = l;
if (i >= 1) unt += dpleft[i-1];
if (i + k < n) unt += dpright[i+k];
best = min(best, unt);
}
return best;
}
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... |