제출 #147140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
147140		nandonathaniel	선물상자 (IOI15_boxes)	C++14	50 / 100	447 ms	18168 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL INF=1e18;
LL dp[1005];

LL dist(LL x,LL y,LL mod){
	return min((y-x+mod)%mod,(x-y+mod)%mod);
}

LL cost(LL a,LL b,LL mod){
	return dist(a,0,mod)+(b-a+mod)%mod+dist(b,0,mod);
}

LL delivery(int N, int K, int L, int p[]) {
	dp[0]=0;
	for(LL i=1;i<=N;i++){
		dp[i]=INF;
		for(LL j=max(i-K,0LL);j<=i-1;j++){
			dp[i]=min(dp[i],dp[j]+cost(p[j],p[i-1],L));
		}
	}
	return dp[N];
}

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