제출 #1155202

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1155202		aarb_.tomatexd	Boxes with souvenirs (IOI15_boxes)	C++20	50 / 100	2093 ms	19780 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = 1e18;

ll delivery(int N, int K, int L, int p[]) {
    vector<ll> pos(N);
    for (int i = 0; i < N; i++) {
        pos[i] = p[i];
    }
    
    vector<ll> dp(N + 1, INF);
    dp[0] = 0;
    
    for (int i = 1; i <= N; i++) {
        int start = max(0, i - K);
        for (int j = start; j < i; j++) {
            ll costBatch = min({(ll)L, 2LL * (L - pos[j]), 2LL * pos[i - 1]});
            dp[i] = min(dp[i], dp[j] + costBatch);
        }
    }
    
    return dp[N];
}

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