제출 #30565

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
30565		inqr	선물상자 (IOI15_boxes)	C++14	100 / 100	523 ms	196128 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define pii pair < int , int >
#define DB printf("debug\n");
#define umax( x , y ) x = max( x , (y) )
#define umin( x , y ) x = min( x , (y) )
#define all(x) x.begin() , x.end()
#define MAXN 10000005
using namespace std;
ll art[MAXN];
ll azl[MAXN];
long long delivery(int N, int K, int L, int p[]) {
	ll ans=1e18;
	for(int i=0;i<N;i++){
		if(i<K)art[i]=min(2*p[i],L);
		else art[i]=art[i-K]+min(2*p[i],L);
	}
	for(int i=N-1;i>=0;i--){
		if(N-1-i<K)azl[i]=min(2*(L-p[i]),L);
		else azl[i]=azl[i+K]+min(2*(L-p[i]),L);
	}
	umin(ans,art[N-1]);
	umin(ans,azl[0]);
	for(int i=0;i<N-1;i++){
		umin(ans,art[i]+azl[i+1]);
	}
	//cout<<ans<<endl;
    return ans;
}

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