Submission #1255343

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255343		lambd47	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	348 ms	196112 KiB

boxes

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


#define ll long long

ll delivery(int n,int k, int l, int positions[]){
    const ll mod=1e15+7;


    vector<ll> dpp(n+7);
    vector<ll> dps(n+7);

    for(int i=0;i<n;i++){
        dpp[i]=2*positions[i];
        if(i>=k){
            dpp[i]+=dpp[i-k];
        }
    }
    for(int i=n-1;i>=0;i--){
        dps[i]=2*(l-positions[i]);
        if(i+k<n){
            dps[i]+=dps[i+k];
        }
    }
    ll resp=mod;
    ll ida;ll volta;

    for(int i=-1;i<n;i++){
        ida=0;volta=0;
        if(i!=-1){
            ida=dpp[i];
        }
        if(i!=n-1){
            volta=dps[i+1];
        }
        resp=min(resp,ida+volta);
    }

    for(int i=-1,j=k;j<=n;j++,i++){
        ida=0;volta=0;
        if(i!=-1){
            ida=dpp[i];
        }
        if(j!=n){
            volta=dps[j];
        }
       // cout<<i<<" "<<ida<<" "<<volta<<"\n";
        resp=min(resp,ida+l+volta);
    }
    return resp;



};

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