Submission #1185377

#TimeUsernameProblemLanguageResultExecution timeMemory
1185377stdfloatBoxes with souvenirs (IOI15_boxes)C++20
100 / 100
340 ms196076 KiB
#include <bits/stdc++.h>
#include "boxes.h"
// #include "grader.cpp"
using namespace std;

using ll = long long;

ll delivery(int n, int K, int L, int p[]) {
	vector<ll> a(n + 2), b(n + 2);
	for (int i = 1; i <= n; i++)
		a[i] = (p[i - 1] << 1) + (K <= i ? a[i - K] : 0);
	for (int i = n; i > 0; i--)
		b[i] = (L - p[i - 1] << 1) + (i + K <= n ? b[i + K] : 0);

	ll mn = LLONG_MAX;
	for (int i = 0; i <= n; i++)
		mn = min({mn, a[i] + b[i + 1], a[i] + L + (i + K + 1 <= n ? b[i + K + 1] : 0)});

	return mn;
}
#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...