제출 #1346285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1346285		nathlol2	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	345 ms	196108 KiB

boxes

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

ll delivery(int n, int k, int l, int p[]){
    auto f = [&](ll x, ll y){
        return min((ll)l, min(y * 2, (l - x) * 2));
    };
    vector<ll> dp(n + 1, INF), dpr(n + 2, INF);
    dp[0] = 0;
    for(int i = 1;i<=n;i++){
        dp[i] = dp[max(0, i - k)] + min(l, 2 * p[i - 1]);
    }
    dpr[n + 1] = 0;
    for(int i = n;i>=1;i--){
        dpr[i] = dpr[min(n + 1, i + k)] + min(l, 2 * (l - p[i - 1]));
    }
    ll ans = INF;
    for(int i = 0;i<=n;i++){
        ans = min(ans, dp[i] + dpr[i + 1]);
    }
    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