# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
576104 | stevancv | Boxes with souvenirs (IOI15_boxes) | C++14 | 542 ms | 271612 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 <bits/stdc++.h>
#include "boxes.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
ll delivery(int N, int K, int D, int pos[]) {
ll n = N; ll k = K; ll d = D;
vector<ll> pref(n), suff(n);
for (int i = 0; i < n; i++) {
pref[i] = 2 * pos[i];
if (i >= k) pref[i] += pref[i - k];
}
for (int i = n - 1; i >= 0; i--) {
suff[i] = 2 * (d - pos[i]);
if (i <= n - k - 1) suff[i] += suff[i + k];
}
ll ans = suff[0];
for (int i = 0; i < n; i++) {
ll x = pref[i];
if (i < n - 1) x += suff[i + 1];
smin(ans, x);
}
if (k < n) smin(ans, d + suff[k]);
else smin(ans, d);
for (int i = 0; i < n; i++) {
ll x = pref[i] + d;
if (i + k + 1 < n) x += suff[i + k + 1];
smin(ans, x);
}
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... |