Submission #1327763

#	Time	Username	Problem	Language	Result	Execution time	Memory
1327763		settop	선물상자 (IOI15_boxes)	C++20	100 / 100	342 ms	196100 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
const ll inf=1e18;

long long delivery(int n, int k, int l, int p[]) {
    vector<ll> dpl(n+1),dpr(n+1);
    
    fall(i,1,n){
        int j=max(0,i-k);
        dpl[i]=dpl[j]+p[i-1]+min(p[i-1],l-p[i-1]);
    }

    rfall(i,n-1,0){
        int j=min(n,i+k);
        dpr[i]=dpr[j]+l-p[i]+min(p[i],l-p[i]);
    }

    ll ans=inf;

    fall(i,0,n) ans=min(ans,dpl[i]+dpr[i]);

    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