| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 769874 | teokakabadze | 선물상자 (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.
long long delivery(int N, int K, int L, int p[])
{
n = N, k = K;
for(i = 0; i < n; i++)
a[i] = p[i];
sort(a, a + n);
d.pb({0, -1});
for(i = 0; i < n; i++)
{
if(d.front().s == i - k - 1) d.pop_front();
dp[i] = 2 * a[i] + d.front().f;
while(d.size() && d.front().f >= dp[i]) d.pop_front();
d.pb({dp[i], i});
}
while(d.size()) d.pop_back();
d.pb({0, n});
for(i = n - 1; i >= 0; i--)
{
if(d.front().s == i + k + 1) d.pop_front();
dp1[i] = 2 * (L - a[i]) + d.front().f;
while(d.size() && d.front().f >= dp1[i]) d.pop_front();
d.pb({dp1[i], i});
}
ans = 1e18;
for(i = 0; i < n; i++)
ans = min(ans, dp[i] + dp1[(i + 1) % n]);
return ans;
}
