Submission #1202072

#TimeUsernameProblemLanguageResultExecution timeMemory
1202072alindBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

long long delivery(int N, int K, int L, int p[]) {
	vector<ll> pref(N), suf(N);
	for (int i = 0; i < N; i++) {
		pref[i] = p[i] + (i < K ? 0 : pref[i - K]);
		suf[N - 1 - i] = L - p[N - 1 - i] + (i < K ? 0 : suf[N - 1 - i + K]);
	}
	ll mn = 1ll<<62;
	for (int i = 0; i < N; i++) mn = min(mn, pref[i] + (i < N - 1 ? suf[i+1] : 0));
	for (int i = 0; i + K <= N; i++) mn = min(mn, L + (i ? pref[i-1] : 0) + (i + K < N ? suf[i + K] : 0));
	return mn * 2;
}
#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...