# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704636 | Alihan_8 | Boxes with souvenirs (IOI15_boxes) | C++17 | 635 ms | 333064 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>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
long long delivery(int n, int k, int L, int P[]){
vector <int> p;
for ( int i = 0; i < n; i++ ){
if ( !P[i] ) continue;
p.pb(P[i]);
}
n = (int)p.size();
vector <long long> pref(n+1), suff(n+2);
for ( int i = 1; i <= n; i++ ){
pref[i] = pref[max(0, i-k)]+p[i-1]*2;
}
for ( auto &i: p ) i = L-i;
for ( int i = n; i > 0; i-- ){
suff[i] = suff[min(n+1, i+k)]+p[i-1]*2;
}
long long Mn = 1e18;
for ( int i = 0; i <= n; i++ ){
Mn = min(Mn, pref[i]+suff[i+1]);
Mn = min(Mn, pref[i]+L+suff[min(n+1, i+k+1)]);
}
return Mn;
}
#if false
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k, L; cin >> n >> k >> L;
int p[n];
for ( int i = 0; i < n; i++ ) cin >> p[i];
cout << delivery(n, k, L, p);
cout << '\n';
/*
3 2 8
1 2 5
answer : 10
*/
}
#endif
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |