제출 #406078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406078		ritul_kr_singh	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	583 ms	265496 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp << ' ' <<
#define nl << '\n'
#include "boxes.h"

ll delivery(int N, int K, int L, int p[]){
	ll pre[N], suf[N];
	for(int i=0; i<N; ++i){
		pre[i] = p[i] * 2LL + (i >= K ? pre[i-K] : 0LL);
	}
	for(int i=N-1; i>=0; --i){
		suf[i] = (L-p[i]) * 2LL + (i + K < N ? suf[i+K] : 0LL);
	}
	ll ans = min(pre[N-1], suf[0]);
	for(int i=0; i+1<N; ++i) ans = min(ans, pre[i] + suf[i+1]);
	for(int i=0; i<N; ++i){
		ll curr = L;
		if(i) curr += pre[i-1];
		if(i+K < N) curr += suf[i+K];
		ans = min(ans, curr);
	}
	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