Submission #130911

#	Time	Username	Problem	Language	Result	Execution time	Memory
130911		antimirage	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	2 ms	376 KiB

boxes

#include "boxes.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 1e7 + 5;

long long dp[N];

long long delivery(int n, int k, int l, int pos[]) {
		
	for (int i = 0; i < n; i++) {
		if (i < k) {
			dp[i] = min( pos[i] * 2, min( l, (l - pos[0] - 1) * 2 ) );
		} else {
			dp[i] = dp[i - k] + min( pos[i] * 2, min( l, (l - pos[i - k + 1] - 1) * 2 ) );
		}
	}
	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