# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1265723 | alexiah | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
using namespace std;
typedef long long ll;
long long delivery(int n, int k, int l, int p[]) {
vector <int> num; num.reserve(n);
set <int> aux;
int ns = 0;
for(int i = 0; i < ns; i++) {
num.push_back(l);
aux.insert(l);
int auxs = aux.size();
aux.insert(p[i]);
if(aux.size() != auxs) {
num.push_back(p[i]); ns++;
}
}
num.push_back(0);
sort(num.begin() , num.end());
int min1 = l;
for(ll i = 0; i < ns; i++){
if(n == 1) p[0]*2;
min1 = min(min1 , 2*(l- (abs(num[i]) - num[i+1])));
}
return min1;
}