제출 #596589

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
596589		PiejanVDC	선물상자 (IOI15_boxes)	C++17	10 / 100	1 ms	332 KiB

boxes

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

long long delivery(int n, int k, int L, int positions[]) {

    vector<long long>l(n+1),r(n+1);

    l[0] = r[0] = 0;

    for(int i = 1 ; i <= n ; i++) {
        int p = max(0, i - k);
        l[i] = l[p] + (long long)2*(positions[i-1]);
        r[i] = r[p] + (long long)2*(L - positions[n - i]);
        //cout << l[i] << ' ' << r[i] << '\n';
    }

    long long ans = (long long)1e18;

    for(int i = 0 ; i <= n ; i++) {
        ans = min(ans, l[i] + r[n-i]);
        ans = min(ans, l[i] + r[max(0,min(n,n-i+k))] + L);
        //cout << i << ' ' << ans << '\n';
    }

    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