| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 608519 | loctildore | Teams (IOI15_teams) | C++14 | 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 "boxes.h"
#include <bits/stdc++.h>
using namespace std;
// trans rights
#define ll long long
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x), end(x)
ll n,k,l;
ll dp1[10000069],dp2[10000069];
long long delivery(int N, int K, int Li, int p[]) {
n=N;k=K;l=Li;
for (ll i = 0; i < n; i++) {
if (i<k) {
dp1[i]=p[i]+min((ll)p[i],l-p[i]);
}
else {
dp1[i]=dp1[i-k]+p[i]+min((ll)p[i],l-p[i]);
}
}
for (ll i = n-1; ~i; i--) {
if (n<=k+i) {
dp2[i]=l-p[i]+min((ll)p[i],l-p[i]);
}
else {
dp2[i]=dp2[i+k]+l-p[i]+min((ll)p[i],l-p[i]);
}
}
ll ans=dp2[0];
for (ll i = 0; i < n; i++) {
ans=min(ans,dp1[i]+dp2[i+1]);
}
return ans;
}