제출 #792149

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
792149		Josia	선물상자 (IOI15_boxes)	C++17	100 / 100	434 ms	196780 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
 
 
#define int int64_t
 
 
long long delivery(signed N, signed K, signed L, signed p[]) {
 
    vector<int> costUntilCW(N);
    vector<int> costUntilCCW(N);

    for (int i = 0; i<N; i++) {
        costUntilCW[i] = (i-K>=0?costUntilCW[i-K]:0)+p[i];
        // cerr << costUntilCW[i] << " ";
    }
    // cerr << "\n";
 
    for (int i = N-1; i>=0; i--) {
        costUntilCCW[i] = (i+K<N?costUntilCCW[i+K]:0)+L-p[i];
        // cerr << costUntilCCW[i] << " ";
    }
    // cerr << "\n";

    int res = min(costUntilCW[N-1]*2, costUntilCCW[0]*2);

    res = min(res, costUntilCW[max(0, N-1-K)]*2 + L);
    res = min(res, costUntilCCW[min(N-1, K)]*2 + L);

    if (K >= N) res = min(res, (int)L);

    for (int i = 0; i<N-1; i++) {
        res = min(res, costUntilCW[i]*2 + costUntilCCW[i+1]*2);
        if (i+K+1 < N) res = min(res, costUntilCW[i]*2 + costUntilCCW[i+K+1]*2 + L);
    }
 
    return res;
}

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