# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102217 | Leonardo_Paes | Boxes with souvenirs (IOI15_boxes) | C++11 | 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;
const int MAXN = 3e7 + 10;
typedef long long ll;
long long delivery(long long N, long long K, long long L, int positions[MAXN]){
long long x = N, sum=0;
long long ini=0, fim=N-1;
for(long long i=x; i>1; i-=2){
if(ini+(K-1)<=N-1 and fim-(K-1)>=0 and (2ll*(positions[ini+(K-1)]))<(2ll*(L-positions[fim-(K-1)]))){
sum+=2ll*(positions[ini+(K-1)]);
ini+=K;
}
else if (2ll*(L-positions[fim-(K-1)]) < L){
sum+=2ll*(L-positions[fim-(K-1)]);
fim-=K;
}
else{
sum+=L;
ini+=K;
}
}
sum+=min(2ll*positions[ini], 2ll*(L-positions[fim]));
return sum;
}