제출 #489358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
489358		SlavicG	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	531 ms	293928 KiB

boxes

#include "bits/stdc++.h"
#include "boxes.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

ll delivery(int n, int k, int l, int positions[]){
    vector<ll> dpl(n + 5, 1e18), dpr(n + 5, 1e18);
    dpl[0] = 0;
    for(int i = 1;i <= n; ++i){
        dpl[i] = dpl[max(0, i - k)] + 2 * positions[i - 1];
    }

    dpr[n + 1] = 0;
    for(int i = n;i >= 1; --i){
        dpr[i] = dpr[min(n + 1, i + k)] + 2 * (l - positions[i - 1]);
    }

    ll ans = 1e18;

    for(int i = 0;i <= n; ++i){
        ans = min(ans, dpl[i] + dpr[i + 1]);
        ans = min(ans, dpl[i] + dpr[min(n + 1, i + 1 + k)] + l);
    }

    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