# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930428 | Cutebol | 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 "boxes.h"
#include <bits/stdc++.h>
using namespace std ;
const int N = 2e7 + 4 ;
#define int long long
template <class T>
bool chmax( T& x , const T& y ){
bool f = 0 ;
if ( x < y ) x = y , f = 1 ;
return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
bool f = 0 ;
if ( x > y ) x = y , f = 1 ;
return f ;
}
int dpl[N] , dpr[N] ;
long long delivery(int n, int k, int l, int a[]) {
for ( int i = 0 ; i < n ; i ++ )
dpl[i] = (( i >= k ) ? dpl[i-k] : 0) + min(l,2*a[i]) ;
for ( int i = n-1 ; i >= 0 ; i -- )
dpr[i] = dpr[i+k] + min(l,2*(l-a[i])) ;
int ans = min(dpr[0],dpr[n-1]) ;
for ( int i = 0 ; i < n ; i ++ ) chmin ( ans , dpl[i]+dpr[i+1] ) ;
return ans ;
}
/*
int a[N] ;
signed main(){
int n , k , l ; cin >> n >> k >> l ;
for ( int i = 0 ; i < n ; i ++ ) cin >> a[i] ;
cout << delivery( n , k , l , a ) ;
}
//*/