# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160808 | GioChkhaidze | Boxes with souvenirs (IOI15_boxes) | C++14 | 673 ms | 372380 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"
using namespace std;
const int N=2e7+5;
long long n,k,l,x,ANS,a[N],Dl[N],Dr[N];
long long delivery(int N, int K, int L, int p[]) {
n=N,k=K,l=L;
if (n==k) ANS=l;
else ANS=1e18;
for (int i=1; i<=n; i++) {
a[i]=p[i-1];
int last=i-k;
if (1<=last) Dl[i]=Dl[last]+a[i]*2;
else Dl[i]=a[i]*2;
}
for (int i=n; i>=1; i--) {
int last=i+k;
if (last<=n) Dr[i]=Dr[last]+(l-a[i])*2;
else Dr[i]=(l-a[i])*2;
}
ANS=min(ANS,Dl[n]);
ANS=min(ANS,Dr[1]);
for (int i=0; i<n; i++) {
ANS=min(ANS,Dl[i]+Dr[i+1]);
ANS=min(ANS,l+Dl[i]+Dr[i+k+1]);
}
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... |