# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238736 | nicolaalexandra | Boxes with souvenirs (IOI15_boxes) | C++14 | 6 ms | 384 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 <bits/stdc++.h>
#include "boxes.h"
#define DIM 10000010
#define INF 2000000000000000000LL
using namespace std;
long long dist_left[DIM],dist_right[DIM],dp_left[DIM],dp_right[DIM];
long long delivery (int n, int k, int l, int v[]){
int i, j, poz, poz2, last = -1;
long long sol = INF;
for (i=0;i<n;i++){
dist_left[i] = v[i];
dist_right[i] = l - v[i];
}
/// dp_left[i] - costul sa ajung la pozitia i
for (i=0;i<n;i++){
if (i < k)
dp_left[i] = v[i] + min (dist_left[i],dist_right[i]);
else dp_left[i] = dp_left[i-k] + v[i] + min (dist_left[i],dist_right[i]);
}
for (i=n-1;i>=0;i--){
if (i >= n-k){
dp_right[i] = dist_right[i] + min (dist_left[i],dist_right[i]);
} else dp_right[i] = dp_right[i+k] + dist_right[i] + min (dist_left[i],dist_right[i]);
}
for (i=0;i<n;i++){
long long val = dp_left[i];
if (i < n-1)
val += dp_right[i+1];
sol = min (sol,val);
}
return sol;
}
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... |