Submission #602606

#	Time	Username	Problem	Language	Result	Execution time	Memory
602606		daisy2	선물상자 (IOI15_boxes)	C++14	100 / 100	526 ms	255652 KiB

boxes

#include<iostream>
#include "boxes.h"
using namespace std;
#define MAX 1000000000000000
long long maone[10000005],maoneri[10000005],maonele[10000005];
long long delivery(int N, int k, int L, int p[]) {

    long long ans=MAX;

    for(int i=1;i<=N;i++)
        maonele[i]=maonele[max(0,i-k)]+2*p[i-1];

    for(int i=N;i>=1;i--){
        maoneri[i]=maoneri[min(N+1,i+k)]+2*(L-p[i-1]);
    }
    for(int i=1;i<=N+1;i++)
    {
        ans=min(ans,maonele[i-1]+maoneri[i]);
    }

    for(int i=1;i<=N;i++)
    {
        ans=min(ans,maonele[max(i-k,0)]+maoneri[i+1]+L);
    }

    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