Submission #446575

#	Time	Username	Problem	Language	Result	Execution time	Memory
446575		FEDIKUS	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	332 KiB

boxes

#include "boxes.h"

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=1e7+10;
ll bn[maxn];
ll bp[maxn];

ll delivery(int n, int k, int l, int p[]) {
    ll ret=LLONG_MAX;
    for(int i=0;i<n;i++){
        if(i==0) bn[i]=2*p[i];
        else{
            bn[i]=bn[max(i-k,0)]+2*p[i];
        }
    }
    for(int i=n-1;i>=0;i--){
        if(i==n-1) bp[i]=2*(l-p[i]);
        else{
            bp[i]=bp[min(i+k,n-1)]+2*(l-p[i]);
        }
    }
    for(int i=-1;i<n;i++){
        ret=min(ret,(i>=0 ? bn[i]:0)+(i+1<n ? bp[i+1]:0));
    }
    for(int i=-1;i<n;i++){
        ret=min(ret,(i>=0 ? bn[i]:0)+l+(i+k+1<n ? bp[i+k+1]:0));
    }
    return ret;
}

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