# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947609 | 2024-03-16T15:29:21 Z | 4QT0R | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long ll pref[10000002]; ll suf[10000002]; ll delivery(ll n, ll k, ll l, ll positions[]){ for (ll i = 0; i<k; i++)pref[i]=positions[i]; for (ll i = k; i<n; i++)pref[i]=positions[i]+pref[i-k]; for (ll i = n-1; i>n-k-1; i--)suf[i]=l-positions[i]; for (ll i = n-k-1; i>=0; i--)suf[i]=l-positions[i]+suf[i+k]; ll ans=suf[0]; for (ll i = 0; i<n-1; i++)ans=min(ans,2*pref[i]+2*suf[i+1]); for (ll i = 0; i<n-1; i++)ans=min(ans,2*pref[i]+l+2*(i+k<n ? suf[i+k] : suf[n-1])); return ans; }