# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481986 | Lobo | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define maxn 10000010
ll n, kt;
ll dp1[maxn], x1[maxn];
ll dp2[maxn], x2[maxn];
int main() {
ios::sync_with_stdio(false); cin.tie(0);
//freopen("in.in", "r", stdin);
//freopen("out.out", "w", stdout);
ii N, K, L;
cin >> N >> K >> L;
vector<ii> p;
for(ii i = 0; i < N; i++) {
ii aa; cin >> aa;
p.pb(aa);
}
ii n1 = 0;
ii n2 = 0;
kt = K;
for(ii i = 1; i <= N; i++) {
dp1[i] = dp2[i] = -1;
x1[i] = p[i-1];
x2[i] = L-x1[i];
if(x1[i] <= x2[i]) {
n1++;
}
else {
n2++;
}
}
reverse(x1+1,x1+1+n2);
priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq1;
pq1.push(mp(0,0));
for(ii i = 1; i <= n1; i++) {
ll ans = INFll;
while(pq1.size() && pq1.top().sc < i-kt) pq1.pop();
ans = pq1.top().fr;
dp1[i] = ans + 2*x1[i];
pq1.push(mp(dp1[i],i));
}
priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq2;
pq2.push(mp(0,0));
for(ii i = 1; i <= n2; i++) {
ll ans = INFll;
while(pq2.size() && pq2.top().sc < i-kt) pq2.pop();
ans = pq2.top().fr;
dp2[i] = ans + 2*x2[i];
pq2.push(mp(dp2[i],i));
}
ll ans = dp1[n1]+dp2[n2];
for(ii i1 = n1-kt, i2 = n2; i1 <= n1; i1++, i2--) {
ans = min(ans, dp1[i1] + dp2[i2] + L);
}
cout << ans << endl;
}