# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
899318 | aykhn | Boxes with souvenirs (IOI15_boxes) | C++17 | 515 ms | 372872 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;
long long delivery(int N, int K, int L, int P[]) {
vector<long long> v;
v.push_back(0);
for (long long i = (P[0] == 0); i < N; i++) v.push_back(P[i]);
long long p[N + 5], s[N + 5];
p[0] = 0;
for (long long i = 1; i < v.size(); i++) p[i] = p[max(0LL, i - K)] + v[i] * 2;
s[v.size()] = 0;
for (long long i = (long long)v.size() - 1; i >= 0; i--) s[i] = s[min((long long)v.size(), i + K)] + 2 * (L - v[i]);
long long res = min(p[(long long)v.size() - 1], s[0]);
if (K >= N) res = min(res, (long long)L);
for (long long i = 0; i < v.size(); i++)
{
res = min(res, p[i] + s[i + 1]);
res = min(res, p[i] + s[min((long long)v.size(), i + K + 1)] + L);
}
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... |