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;
#define ll long long
ll delivery(int n,int k,int l,int*a){
if(k==1){
ll ans=0;
for(int i=0;i<n;i++)ans+=min(a[i]*2,(l-a[i])*2);
return ans;
}
if(k==n){
ll ans=min(l,2*a[n-1]);
for(int i=0;i<n-1;i++){
ans=min(ans,(ll)a[i]*2+(ll)2*(l-a[i+1]));
}
return ans;
}
return 0LL;
}
| # | 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... |