제출 #930433

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
930433		Cutebol	선물상자 (IOI15_boxes)	C++17	0 / 100	0 ms	348 KiB

boxes

#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 = 1 ; i <= n ; i ++ )
		dpl[i] = dpl[max(i-k,0)] + min(l,2*a[i-1]) ;
	for ( int i = n ; i > 0 ; i -- )
		dpr[i] = dpr[i+k] + min(l,2*(l-a[i-1])) ;
	long long ans = min(dpr[1],dpr[n]) ;
	for ( int i = 1 ; 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 ) ;
}
//*/

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30