# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587029 | keta_tsimakuridze | 선물상자 (IOI15_boxes) | C++14 | 539 ms | 254996 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;
#define ll long long
long long delivery(int N, int K, int L, int p[]) {
vector<int> a, b;
a.push_back(-1);
for(int i = 0; i < N; i++) {
if(p[i] <= L - p[i]) a.push_back(p[i]);
else b.push_back(L - p[i]);
}
b.push_back(-1);
reverse(b.begin(), b.end());
vector<ll> dpa(a.size()), dpb(b.size());
for(int i = 1; i < a.size(); i++) {
dpa[i] = (i >= K ? dpa[i - K] + a[i] * 2 : a[i] * 2);
}
for(int i = 1; i < b.size(); i++) {
dpb[i] = (i >= K ? dpb[i - K] + b[i] * 2 : b[i] * 2);
}
ll ans = dpa[(int)a.size() - 1] + dpb[(int)b.size() - 1];
for(int i = 0; i < a.size(); i++) {
if((int)a.size() - i - 1 > K) continue;
int lft = K - ((int)a.size() - i - 1);
int id = max(0, (int)b.size() - 1 - lft);
ans = min(ans, dpa[i] + dpb[id] + L);
}
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... |