제출 #1211499

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1211499		XCAC197	선물상자 (IOI15_boxes)	C++20	100 / 100	372 ms	196168 KiB

boxes

#include "boxes.h"
#include <vector>
#include <iostream>
#define ll long long
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    ll prefix [N+1];
    ll suffix [N+1];
    prefix[0] = 0;
    for(int i = 1; i <= N; i++){
        prefix[i] = min((ll)(L), (ll)(2*p[i-1])) + prefix[max(0ll, (ll)(i-K))];
    }
    suffix[0] = 0;
    for(int i = 1; i <= N; i++){
        suffix[i] = min((ll)(L), (ll)(2*(L-p[N-i]))) + suffix[max(0ll, (ll)(i-K))];
    }
    ll ans = (1ll << 60);
    for(int i = 0; i <= N; i++){
   //     cout << prefix[i] << "/" << suffix[i] << endl;
        ans = min(ans, prefix[i] + suffix[N-i]);
    }
    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