제출 #1120975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120975		SalihSahin	선물상자 (IOI15_boxes)	C++14	100 / 100	696 ms	372124 KiB

boxes

#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#include "boxes.h"

const long long inf = 1e18;

long long delivery(int N, int K, int L, int p[]) {
    vector<long long> pos(N);
    for(int i = 0; i < N; i++){
        pos[i] = p[i];
    }

    vector<long long> dpl(N+1), dpr(N+1);
    for(int i = 1; i <= N; i++){
        if(i < K) dpl[i] = min((long long)L, pos[i-1] * 2);
        else dpl[i] = dpl[i - K] + min((long long)L, pos[i-1] * 2);
    }

    for(int i = 1; i <= N; i++){
        if(i < K) dpr[i] = min((long long)L, (L - pos[N-i]) * 2);
        else dpr[i] = dpr[i - K] + min((long long)L, (L - pos[N-i]) * 2);
    }

    long long ans = inf;
    for(int l = 0; l <= N; l++){
        int r = N - l;
        ans = min(ans, dpl[l] + dpr[r]);
    }
    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