Submission #930431

#TimeUsernameProblemLanguageResultExecution timeMemory
930431CutebolBoxes with souvenirs (IOI15_boxes)C++17
0 / 100
1 ms2392 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std ; const int N = 2e7 + 4 ; 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 ; } long long 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])) ; long long 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 ) ; } //*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...