Submission #16722

#	Time	Username	Problem	Language	Result	Execution time	Memory
16722		comet	선물상자 (IOI15_boxes)	C++98	100 / 100	539 ms	196988 KiB

boxes

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
typedef long long ll;
#include "boxes.h"

ll l[10000000],r[10000000];
ll delivery(int N,int K,int L,int p[]){
	for(int i=0;i<K;i++){
		l[i]=min(2ll*p[i],(ll)L);
	}
	for(int i=K;i<N;i++){
		l[i]=l[i-K]+min(2ll*p[i],(ll)L);
	}
	for(int i=N-1;i>=N-K;i--){
		r[i]=min(2ll*(L-p[i]),(ll)L);
	}
	for(int i=N-K-1;i>=0;i--){
		r[i]=r[i+K]+min(2ll*(L-p[i]),(ll)L);
	}
	ll ans=min(l[N-1],r[0]);
	for(int i=1;i<N;i++){
		ans=min(ans,l[i-1]+r[i]);
	}
	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