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"
#define ll long long
using namespace std;
ll delivery(int n, int k, int x, int a[]) {
int l = 0, r = n-1;
sort(a,a+n);
ll ans = 0;
while(l <= r){
int y = 1e9;
y = min(y,a[min(l+k-1,r)] + min(a[min(l+k-1,r)],x-a[min(l+k-1,r)]));
y = min(y,x-a[max(r-k+1,l)] + min(a[max(r-k+1,l)],x-a[max(r-k+1,l)]));
ans += y;
if(y == a[min(l+k-1,r)] + min(a[min(l+k-1,r)],x-a[min(l+k-1,r)]+1)){
l += k;
}
else {
r -= k;
}
}
return ans;
}
# | 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... |