# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
783274 | Gabriel2222 | Boxes with souvenirs (IOI15_boxes) | C++11 | 0 ms | 0 KiB |
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"
int delivery(int N, int K, int L, int p[]) {
int respuesta = 0;
long long _ndice = 0;
long long mitad = L / 2;
while(_ndice < N){
if(p[_ndice] > mitad) respuesta += (L - p[_ndice]) * 2;
else respuesta += p[_ndice * 2];
_ndice++;
}
return respuesta;
}