Submission #519338

#TimeUsernameProblemLanguageResultExecution timeMemory
519338pavementBoxes with souvenirs (IOI15_boxes)C++17
100 / 100
539 ms222292 KiB
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll ans, cum[10000005], sf[10000005];

ll delivery(int N, int K, int L, int p[]) {
	for (int i = N - 1; i >= 0; i--)
		sf[i] = (i + K < N ? sf[i + K] : 0ll) + 2ll * (ll)(L - p[i]);
	ans = sf[0];
	for (int i = 0; i < N; i++) {
		cum[i % K] += min(L, 2 * p[i]);
		ans = min(ans, cum[i % K] + sf[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...