# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671755 | mseebacher | 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;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
ll delivery(int N, int K, int L, int pos[]){
for(int i = 0;i<N;i++){
if(pos[i] > L/2) pos[i]-= L/2;
sum += pos[i];
}
return sum;
}