# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977928 | 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"
using namespace std;
long long delivery(int n, int k, int l, vector<int> positions){
long long answer = 0;
for(int &i : positions)
answer += (min(i, l - i) << 1);
return answer;
}