제출 #1301846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1301846		nicolo_010	선물상자 (IOI15_boxes)	C++20	0 / 100	5 ms	8008 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int mxN = 1e6+5;

ll delivery(int n, int k, int l, int* a) {
	vector<int> pos(n);
	for (int i=0; i<n; i++) {
		pos[i] = a[i];
	}
	ll dp[mxN];
	for (int i=0; i<n; i++) {
		dp[i] = 1e18;
	}
	dp[0] = 2*min(pos[0], l-pos[0]);
	for (int s=0; s<k; s++) {
		int le = pos[0];
		int r = pos[0+s];
		ll coste = min(2*min(r, l-le), l);
		dp[s] = coste;
	}
	for (int i=0; i<n; i++) {
		for (int s=1; s<=k; s++) {
			if (i+s >= n) break;
			int le = pos[i];
			int r = pos[i+s];
			ll coste = min(2*min(r, l-le), l);
			//cout << i << " " << s << " " << dp[i] << " " << coste << endl;
			dp[i+s] = min(dp[i+s], dp[i]+coste);
		}
		//cout << dp[i] << endl;
	}
	return dp[n-1];
}

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