Submission #444875

#	Time	Username	Problem	Language	Result	Execution time	Memory
444875		osmanallazov	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	1 ms	272 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll delivery(int N, int K, int L, int p[]) {
    ll pref[N];
    ll suff[N];
    ll x=K;
    for(ll i=0;i<N;i++){
        if(i<x){
            pref[i]=min(L,p[i]*2);
        }
        else{
            pref[i]=min(L,p[i]*2)+pref[i*x/x-1];
        }
    }
    for(ll i=N-1;i>=0;i--){
        if(N-i-1<x){
            suff[i]=min(2*(L-p[i]),L);
        }
        else{
            suff[i]=min(2*(L-p[i]),L)+suff[i*x/x+1];
        }
    }
    ll 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: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30