Submission #762312

#TimeUsernameProblemLanguageResultExecution timeMemory
762312ZeroCoolBoxes with souvenirs (IOI15_boxes)C++14
0 / 100
1 ms292 KiB
#include "boxes.h"
#include <bits/stdc++.h>
#define ll long long
#define inf 1e18

using namespace std;

ll delivery(int n, int k, int l, int arr[]) {
    
    ll pref[n+5];
    ll suff[n+5];
    for(int i = 0;i<n+5;i++){
        pref[i] = 0;
        suff[i] = 0;
    }

    
    for(int i = 1;i<=n;i++){
        pref[i] = pref[max(0,i - k) + 2 * arr[i-1]];
	}
	
	for(int i = n;i>=1;i--){
		suff[i] = suff[min(n + 1,i + k)] + 2 * (l - arr[i - 1]);
	}
	
	ll best = inf;
	
	for(int i = 0;i<=n;i++){
		best = min(best,pref[i] + suff[i + 1]);
	}
	
	for(int i=0;i<=n-k;i++){
		best = min(best,pref[i] + suff[i+k+1] + l);
	}
	return best;
    
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...