Submission #1245811

#	Time	Username	Problem	Language	Result	Execution time	Memory
1245811		warrenn	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	361 ms	235240 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;


long long delivery(int n, int k, int l, int p[]) {
    int pos[n+1];
    for(int q=1;q<=n;q++){
        pos[q]=p[q-1];
    }
    long long pref[n+1];
    pref[0]=0;
    for(long long q=1;q<=n;q++){
        if(q<=k){
            pref[q]=pos[q]+min(pos[q],l-pos[q]);
        }
        else{
            pref[q]=pref[q-k]+pos[q]+min(pos[q],l-pos[q]);
        }
    }
    long long suf[n+2];
    suf[n+1]=0;
    for(long long q=n;q>=1;q--){
        if(q>n-k){
            suf[q]=(l-pos[q])+min(pos[q],l-pos[q]);
        }
        else{
            suf[q]=suf[q+k]+(l-pos[q])+min(pos[q],l-pos[q]);
        }
    }
    long long ans=1e18;
    for(long long q=0;q<=n;q++){
        ans=min(ans,pref[q]+suf[q+1]);
    }
    return ans;
}

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