# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72803 | square1001 | Boxes with souvenirs (IOI15_boxes) | C++14 | 896 ms | 313920 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 <vector>
#include <algorithm>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
vector<int> lv, rv;
for(int i = 0; i < N; ++i) {
if(2 * p[i] < L) {
lv.push_back(p[i]);
}
else {
rv.push_back(L - p[i]);
}
}
sort(lv.begin(), lv.end());
sort(rv.begin(), rv.end());
int ls = lv.size(), rs = rv.size();
vector<long long> ld(ls + 1), rd(rs + 1);
for(int i = 1; i <= ls; ++i) {
ld[i] = (i < K ? 0 : ld[i - K]) + 2 * lv[i - 1];
}
for(int i = 1; i <= rs; ++i) {
rd[i] = (i < K ? 0 : rd[i - K]) + 2 * rv[i - 1];
}
long long ret = ld[ls] + rd[rs];
for(int i = ls - K + 1; i <= ls && i <= N - K; ++i) {
ret = min(ret, ld[i] + rd[N - K - i] + L);
}
return ret;
}
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... |