Submission #1217055

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217055		takoshanava	선물상자 (IOI15_boxes)	C++20	10 / 100	0 ms	328 KiB

boxes

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

const int MAX = 10000005;
long long dp1[MAX], dp2[MAX];

long long delivery(int N, int K, int L, int pos[]) {
    for(int i = 0; i < N; i++){
        dp1[i] = dp1[max(0, i - K)] + pos[i] + min(pos[i], (L - pos[i]));
    }
    
    for(int i = N - 1; i >= 0; i--){
        dp2[i] = dp2[min(N, i + K)] + (L - pos[i]) + min(pos[i], (L - pos[i]));
    }

    long long ans = 1e18;

    for(int i = 0; i <= N - 1; i++){
        ans = min(ans, dp1[i] + dp2[i + 1]);
    }
    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