Submission #355562

#TimeUsernameProblemLanguageResultExecution timeMemory
355562NachoLibreBoxes with souvenirs (IOI15_boxes)C++17
100 / 100
617 ms267384 KiB
#include <bits/stdc++.h>
using namespace std;
#ifndef wambule
#include "boxes.h"
#endif

long long delivery(int n, int k, int ll, int p[]) {
	long long l[n], r[n];
	l[0] = r[0] = 0;
	for(int i = 1; i <= n; ++i) {
		long long x = (i >= k ? l[i - k] : 0);
		l[i] = x + 2 * p[i - 1];
	}
	for(int i = 1; i <= n; ++i) {
		long long x = (i >= k ? r[i - k] : 0);
		r[i] = x + 2 * (ll - p[n - i]);
	}
	long long dr = min(l[n], r[n]);
	for(int i = 0; i <= n; ++i) {
		dr = min(dr, l[i] + r[n - i]);
	}
	for(int i = 0; i <= n - k; ++i) {
		dr = min(dr, l[i] + ll + r[n - i - k]);
	}
	return dr;
}

#ifdef wambule
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	return 0;
}
#endif
#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...