답안 #930425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930425 2024-02-19T15:18:48 Z Cutebol 선물상자 (IOI15_boxes) C++17
10 / 100
2 ms 2648 KB
#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 ;
}

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 = dpr[0] ;
	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 ) ;
}
//*/
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Incorrect 1 ms 2644 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -