#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long delivery(int n, int k, int l, int p[]) {
vector <int> num;
set <int> aux;
for(int i = 0; i < n; i++) {
aux.insert(p[i]);
if(aux.size() != num.size()) num.push_back(p[i]);
}
num.push_back(0);
sort(num.begin() , num.end());
int min1 = l;
for(ll i = 0; i < num.size(); i++){
min1 = min(min1 , 2*(l- (abs(num[i]) - num[i+1])));
}
return min1;
}
# | 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... |