oj.uz

Submission #889048

# Submission time Handle Problem Language Result Execution time Memory
889048 2023-12-18T17:21:45 Z TahirAliyev Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 5 ms 8412 KB 
#include "boxes.h"
#include <bits/stdc++.h>

#define ll long long
#define oo 1e9
#define pii pair<int, int>

using namespace std;

const int MAX = 1005;

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

ll rec(int l, int r){
    if(dp[l][r] != -1) return dp[l][r];
    if(r - l + 1 <= k){
        return min(min(2 * arr[r], 2 * (s - arr[l])), s);
    }
    ll ans = rec(l + k, r) + min(arr[l + k - 1] * 2, s);
    ans = min(ans, rec(l, r - k) + min((s - arr[r - k + 1]) * 2, s));
    return dp[l][r] = ans;
}

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, -1, sizeof(dp));
    return rec(1, n);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 5 ms 8284 KB Output is correct
3 Correct 5 ms 8284 KB Output is correct
4 Correct 5 ms 8284 KB Output is correct
5 Correct 5 ms 8388 KB Output is correct
6 Correct 5 ms 8412 KB Output is correct
7 Correct 5 ms 8284 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8304 KB Output is correct
2 Correct 2 ms 8280 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Incorrect 4 ms 8284 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8304 KB Output is correct
4 Correct 2 ms 8280 KB Output is correct
5 Incorrect 2 ms 8284 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 5 ms 8284 KB Output is correct
3 Correct 5 ms 8284 KB Output is correct
4 Correct 5 ms 8284 KB Output is correct
5 Correct 5 ms 8388 KB Output is correct
6 Correct 5 ms 8412 KB Output is correct
7 Correct 5 ms 8284 KB Output is correct
8 Correct 2 ms 8304 KB Output is correct
9 Correct 2 ms 8280 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Incorrect 4 ms 8284 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 5 ms 8284 KB Output is correct
3 Correct 5 ms 8284 KB Output is correct
4 Correct 5 ms 8284 KB Output is correct
5 Correct 5 ms 8388 KB Output is correct
6 Correct 5 ms 8412 KB Output is correct
7 Correct 5 ms 8284 KB Output is correct
8 Correct 2 ms 8304 KB Output is correct
9 Correct 2 ms 8280 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Incorrect 4 ms 8284 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 5 ms 8284 KB Output is correct
3 Correct 5 ms 8284 KB Output is correct
4 Correct 5 ms 8284 KB Output is correct
5 Correct 5 ms 8388 KB Output is correct
6 Correct 5 ms 8412 KB Output is correct
7 Correct 5 ms 8284 KB Output is correct
8 Correct 2 ms 8304 KB Output is correct
9 Correct 2 ms 8280 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Incorrect 4 ms 8284 KB Output isn't correct
13 Halted 0 ms 0 KB -