Submission #61751

#TimeUsernameProblemLanguageResultExecution timeMemory
61751nvmdavaBoxes with souvenirs (IOI15_boxes)C++17
100 / 100
518 ms196052 KiB
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;

long long l[10000050],r[10000050];

long long delivery(int n, int k, int len, int p[]) {
	int i;
	for(i = 1;i <= n; i++) l[i] = l[max(i - k, 0)] + (long long)min(p[i - 1] * 2, len);
	for(i = n;i >= 1; i--) r[i] = r[min(i + k, n + 1)] + (long long)min(len * 2 - p[i - 1] * 2, len);
	long long ans = 1e18;
	for(i = 0;i <= n; i++){
		ans = min(ans , l[i] + r[i + 1]);
	}
	return ans;
}
#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...