Submission #963646

#	Time	Username	Problem	Language	Result	Execution time	Memory
963646		hirayuu_oj	선물상자 (IOI15_boxes)	C++17	10 / 100	1 ms	348 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) x.begin(),x.end();
using ll=long long;
const ll INF=1LL<<60;

long long delivery(int N, int K, int L, int p[]) {
    vector<ll> dp(N+1,0);
    rep(i,N){
        dp[i+1]=p[i]+dp[max(0,i+1-K)]+min(p[i],L-p[i]);
    }
    vector<ll> dp2(N+1,0);
    for(int i=N-1;i>=0;i--){
        p[i]=(L-p[i])%L;
        dp2[i]=p[i]+dp2[min(N,i+K)]+min(p[i],L-p[i]);
    }
    ll ans=INF;
    rep(i,N+1){
        ans=min(ans,dp[i]+dp2[i]);
    }
    return ans;
}

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