제출 #1346273

#제출 시각아이디문제언어결과실행 시간메모리
1346273nathlol2Boxes with souvenirs (IOI15_boxes)C++20
50 / 100
2095 ms12048 KiB
#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);
    dp[0] = 0;
    for(int i = 1;i<=n;i++){
        for(int j = i;j>=1 && j > i - k;j--){
            dp[i] = min(dp[i], dp[j - 1] + f(p[j - 1], p[i - 1]));
        }
    }
    return dp[n];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...