| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 208517 | gratus907 | 선물상자 (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;
#define ll long long
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx,avx2,fma")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define usecppio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int ll
#define all(x) ((x).begin()),((x).end())
#define eps 1e-7
using pii = pair<int, int>;
#include "boxes.h"
int pl[10101010], mi[10101010];
long long delivery(int N, int K, int L, int p[]) {
int n = N, k = K, l = L;
for (int i = 0; i<n; i++)
{
if (i >= k)
pl[i] = pl[i-k]+p[i]+min(p[i],l-p[i]);
else pl[i] = p[i]+min(l-p[i],p[i]);
}
for (int i = n-1; i>=0; i--)
{
if ((n-i)>=k)
mi[i] = mi[i+k]+l-p[i]+min(l-p[i],p[i]);
else mi[i] = (l-p[i])+min(l-p[i],p[i]);
}
int ans = mi[0];
for (int i = 0; i<n; i++)
ans = min(ans, pl[i]+mi[i+1]);
ans = min(ans, pl[n-1]);
return ans;
}