# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977933 | KasymK | Boxes with souvenirs (IOI15_boxes) | C++17 | 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 "bits/stdc++.h"
#include "boxes.h"
using namespace std;
long long delivery(int n, int k, int l, vector<int> positions){
long long answer = 0;
for(int i = 0; i < n; ++i)
answer += (min(positions[i], l - positions[i]) * 2LL);
return answer;
}