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
long long delivery(int N, int K, int L, int p[]) {
ll res=0;
vector<ll>v;
for(int i=0;i<N;i++){
v.push_back(p[i]);
}
if(K==1){
for(int i=0;i<N;i++){
if(p[i]==0){
res+=0;
}
else if(p[i]<=L/2){
res+=(p[i]*2);
}
else{
res+=((L-p[i])*2);
}
}
}
else if(K==N){
res=L;
v.push_back(0);
v.push_back(L);
sort(v.begin(),v.end());
for(int i=0;i<N+1;i++){
res=min(res,(v[i]+L-v[i+1])*2);
}
}
return res;
}
# | 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... |