# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420093 | dxz05 | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 204 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>
typedef long long ll;
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
vector<int> v;
for (int i = 0; i < N; i++){
if (p[i]) v.push_back(p[i]);
}
N = v.size();
ll ans = 0;
while (!v.empty()){
int sz = v.size();
if (sz <= K){
int fr = L - v[0], ls = v[sz - 1];
ans += min({L, fr * 2, ls * 2});
v.clear();
break;
}
int cost1 = min(L, v[K - 1] * 2);
int cost2 = min(L, v[sz - K] * 2);
if (cost1 <= cost2){
ans += cost1;
v.erase(v.begin(), v.begin() + K);
} else {
ans += cost2;
v.erase(v.end() - K, v.end());
}
}
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... |