Submission #519585

#	Time	Username	Problem	Language	Result	Execution time	Memory
519585		silverfish	Boxes with souvenirs (IOI15_boxes)	C++14	50 / 100	2085 ms	19824 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
using ll = long long;
const int N = 10000007;

ll dp[N], p[N];

long long delivery(int n, int k, int L, int P[]) {
	ll l = L;
	fill(dp, dp+n+1, 1e18+10);
	for(int i = 0; i < n; ++i) p[i+1] = P[i];

	dp[0] = 0;
	for(int i = 1; i <= n; ++i){
		ll mn = min(l, 2LL*p[i]);
		for(int j = i; j > max(i-k, 0); --j){
			ll cmn = min(mn, 2LL*(l-p[j]));
			dp[i] = min(dp[i], dp[j-1] + cmn);
		}
	}

    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