Submission #531016

#TimeUsernameProblemLanguageResultExecution timeMemory
531016buidangnguyen05Boxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms332 KiB
/* input

*/

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 1e7 + 10;
ll f[N], g[N];

ll delivery(int n, int k, int l, int a[]) {
	for (int i = 1; i <= n; ++i) f[i] = f[max(0, i - k)] + min(2 * a[i - 1], l);
	for (int i = n; i; --i) g[i] = g[min(n + 1, i + k)] + min(2 * (l - a[i - 1]), l);

	ll res = 1e18;
	for (int i = 1; i <= n; ++i) res = min(res, f[i] + g[i + 1]);
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...