# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260663 | youssefbou62 | 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 "boxes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
ll ans = 0 ;
int m = N,split=0;
ll L1 = 1LL*L ;
ll P1[N];
for(int i = 0 ; i < N ; i++ )P1[i] = p[i];
for(int i = 0 ; i < N ;i++ )
if( P1[i] > L1/2 ){
m = i ;
if( i )
split = (P1[i]-P1[i-1])*2 > L1 ;
break ;
}
int l = -1 , r = N ;
for(int i = 0 ; i < m ; i++ ){
if( (i+1) % K == 0 ){
ans += P1[i]*2 ;
l = i ;
}
}
for(int i = N-1 ; i >= m ; i-- ){
if( (N-i)%K==0 ){
ans += 2*(L1-P1[i]) ;
r = i ;
}
}
// cerr << ans << endl;
if( split ){
if( m-1 >= l + 1 ){
ans += P1[m-1]*2 ;
}
if( m <= r-1 ){
ans += (L1-P1[m])*2;
}
}else {
if( l == m-1 ){
if( r != m )ans += (L1-P1[m])*2 ;
}
else if( r == m ){
ans += (P1[m-1])*2;
}
else ans += (r-l-1>K?((L1-P1[m]*2+(P1[m-1])*2):L1));
}
return ans;
}
// int main() {
// int N, K, L, i;
// cin >> N >> K >> L ;
// int p[N] ;
// for (i = 0; i < N; i++) {
// cin >> p[i] ;
// }
// cout << delivery(N,K,L,p);
// return 0;
// }