Submission #601923

#	Time	Username	Problem	Language	Result	Execution time	Memory
601923		Summers	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	470 ms	215416 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long a[30000002];

long long delivery(int N, int K, int L, int p[]) {

    long long mid, i, ans=0;
    for(mid=0;mid<N;mid++)
    {
        if(p[mid]>L/2)break;
    }
    //mid=min(mid,(long long)N-1);

    for(i=0;i<mid;i++)
    {
        a[i]=p[i]*2;

        if(i>=K)a[i]+=a[i-K];
    }
    for(i=N-1;i>=mid;i--)
    {
        a[i]=(L-p[i])*2;

        if(N-i>K)a[i]+=a[i+K];
    }
    ans=a[mid]+a[mid-1];

    for(i=max((long long)(-1),mid-K);i<min((long long)N,mid);i++)
    {
        if(i!=-1)ans=min(ans, a[i]+a[i+K+1]+L);
        else ans=min(a[i+K+1]+L,ans);
    }
    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