# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402884 | EJOI2019Andrew | Boxes with souvenirs (IOI15_boxes) | C++14 | 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"
long long delivery(int N, int K, int L, int p[]) {
if(K==1)
{
long long int ans = 0;
for(int i = 0; i < N; ++i)
ans+=min(p[i],L-p[i])*2;
return ans;
}
}