#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 <ll> num;
set <ll> aux;
ll ans = l;
num.push_back(0);
aux.insert(0);
num.push_back(l);
aux.insert(l);
for(int i = 0; i < n; i++) {
ll auxs = aux.size();
aux.insert(p[i]);
if(aux.size() > auxs) {
num.push_back(p[i]);
}
}
ll tam = num.size();
sort(num.begin() , num.end());
for(ll i = 0; i < tam-1; i++){
ans = min(ans , 2*(l- (num[i] - num[i+1])));
}
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... |