제출 #102246

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102246		Leonardo_Paes	Boxes with souvenirs (IOI15_boxes)	C++11	100 / 100	605 ms	294116 KiB

boxes

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 3e7 + 10;

typedef long long ll;

ll pre[MAXN], suf[MAXN];

ll delivery(int N, int K, int L, int positions[]){

    ll sum;

    for(int i=0; i<N; i++){
        pre[i] = 2ll*positions[i];
        if(i >= K)pre[i] += pre[i-K];
    }

    for(int i=N-1; i>=0; i--){
        suf[i] = 2ll*(L-positions[i]);
        if(i+K < N)suf[i] += suf[i+K];
    }

    sum = min(suf[0], pre[N-1]);

    if(N==K)sum=min(sum, (ll)L);

    for(int i=0; i<N-1; i++){
        sum = min(sum, pre[i] + suf[i+1]);
        if(i+K+1<N)sum = min(sum, pre[i] + L + suf[i+1+K]);
        else sum = min(sum, pre[i] + L);
    }

    return sum;
}

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