# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1008014 | Mardonbekhazratov | Boxes with souvenirs (IOI15_boxes) | C++17 | 2043 ms | 600 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>
#define ll long long
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
sort(p,p+N);
if(K==1){
ll ans=0;
for(int i=0;i<N;i++) ans+=min(p[i],L-p[i])*2;
return ans;
}
if(K==N){
ll ans=L;
for(int i=0;i<N;i){
ans=min(ans,2ll*p[i-1]+(L-p[i])*2);
}
ans=min(ans,2LL*min({p[0],L-p[0],p[N-1],L-p[N-1]}));
return ans;
}
// 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... |