Submission #444867

#	Time	Username	Problem	Language	Result	Execution time	Memory
444867		osmanallazov	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	566 ms	199628 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
    long long pref[N];
    long long suff[N];
    for(int i=0;i<N;i++){
        if(i<K){
            pref[i]=min(L,p[i]*2);
        }
        else{
            pref[i]=min(L,p[i]*2)+pref[i-K];
        }
    }
    for(int i=N-1;i>=0;i--){
        if(N-i-1<K){
            suff[i]=min(2*(L-p[i]),L);
        }
        else{
            suff[i]=min(2*(L-p[i]),L)+suff[K+i];
        }
    }
    long long res=min(pref[N-1],suff[0]);
    for(int i=0;i<N-1;i++){
        res=min(res,pref[i]+suff[i+1]);
    }
    return res;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30