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[]) {
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({L-p[0],p[N-1]}));
return ans;
}
return 0;
}
# | 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... |