# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134697 | Boxworld | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 256 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;
long long delivery(int N, int K, int L, int p[]){
int m=-1;
long long ans=0;
for (int i=0;i<N;i++)
if (p[i]*2<L)m=i;
int r=m,l=m+1;
for (int j=0;j*K<=N;j++){
long long ans1=j*L;
for (int i=0;i<K;i++){
if (r!=0&&p[r]>L-p[l])r--;
else if (l<N)l++;else r--;
}
for (int i=r;i>=0;i-=K)ans1+=p[i]*2;
for (int i=l;i<N;i+=K)ans1+=(L-p[i])*2;
ans=min(ans,ans1);
}
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... |