# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420242 | 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;
const int MAXN = 1111111;
void build(vector<int> &v, int K, int L, vector<ll> &dp){
ll cost = 0, prizes = K;
for (int i = 0; i < v.size(); i++){
if (i < K){
dp[i] = v[i] * 2;
} else dp[i] = dp[i - K] + min(L, (v[i] - v[i - K]) * 2);
}
}
long long delivery(int N, int K, int L, int p[]) {
vector<int> v, lf, rg;
for (int i = 0; i < N; i++){
if (p[i] == 0) continue;
lf.push_back(p[i]);
rg.push_back(L - p[i]);
}
N = lf.size();
if (N == 0) return 0ll;
reverse(rg.begin(), rg.end());
vector<ll> dp1(N), dp2(N);
build(lf, K, L, dp1);
build(rg, K, L, dp2);
ll ans = min(dp1[N - 1], dp2[N - 1]);
for (int i = 0; i < N - 1; i++){
ans = min(ans, dp1[i] + dp2[N - i - 2]);
}
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... |