# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319529 | tjdgus4384 | 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<bits/stdc++.h>
#include "boxex.h"
using namespace std;
int delivery(int N, int K, int L, int[] positions){
int i, ans = 0;
for(i = 0;i + K - 1 < N;i += K){
if(positions[i] > L/2) ans += (L-positions[i])*2;
else if(positions[i + K - 1] < L/2) ans += (positions[i + K - 1])*2;
else{
for(int j = i+1;j <= i + K - 1;j++){
if(positions[j+1]-positions[j] > L/2){
ans += (L-positions[j+1]+positions[j])*2;
goto next;
}
}
ans += L;
}
next:;
}
return ans;
}