Submission #1197752

#	Time	Username	Problem	Language	Result	Execution time	Memory
1197752		TahirAliyev	Boxes with souvenirs (IOI15_boxes)	C++17	50 / 100	23 ms	4424 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>

#define ll long long
#define pii pair<int, int>

using namespace std;

const ll MAX = 1005, oo = 1e18;

ll dp[MAX];
int arr[MAX];
int n, k, s;

ll delivery(int N, int K, int L, int p[]){
    n = N;
    k = K;
    s = L;
    for(int i = 1; i <= n; i++) arr[i] = p[i - 1];
    memset(dp, 0, sizeof(dp));
    for(int i = 1; i <= n; i++){
        dp[i] = oo;
        for(int j = max(0, i - k); j < i; j++){
            dp[i] = min(dp[i], dp[j] + min({2 * arr[i], 2 * (s - arr[j + 1]), s}));
        }
    }
    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