Submission #714058

#	Time	Username	Problem	Language	Result	Execution time	Memory
714058		thimote75	선물상자 (IOI15_boxes)	C++14	50 / 100	2091 ms	21684 KiB

boxes

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

#define num long long

vector<num> dp;

num valuation (int L, int P) {
    return min(P, L - P);
}

long long delivery(int N, int K, int L, int p[]) {
    sort(p, p + N);
    
    dp.resize(N + 1, 0);
    dp[0] = 0;
    dp[1] = valuation(L, p[0]) * 2;

    for (int i = 2; i <= N; i ++) {
        int pos = p[i - 1];
        num mov = valuation(L, pos) + pos;
        num mmv = 1e18;

        for (int j = max(0, i - K); j < i; j ++) {
            num del = valuation(L, p[j]) - p[j];

            mmv = min(mmv, del + dp[j]);
        }

        dp[i] = mmv + mov;
    }

    //for (int i = 0; i <= N; i ++)
    //    cout << dp[i] << " ";
    //cout << endl;

    return dp[N];
}

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