# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
346827 | 1bin | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll x, ans;
vector<ll> arr, A, B;
ll delivery(ll N, ll K, ll L, ll positions[]) {
arr.resize(N + 2);
for (int i = 1; i <= N; i++) arr[i] = positions[i - 1];
A.resize(N + 2); B.resize(N + 2);
for (int i = 0; i <= N; i++) {
if (i <= K) A[i] = arr[i] * 2;
else A[i] = arr[i] * 2 + A[i - K];
}
for (int i = N + 1; i; i--) {
if (i >= N + 1 - K) B[i] = (L - arr[i]) * 2;
else B[i] = (L - arr[i]) * 2 + B[i + K];
}
ans = 198765432198765432;
for (int i = 0; i <= N; i++)
ans = min(ans, A[i] + B[i + 1]);
return ans;
}