oj.uz

Submission #947035

# Submission time Handle Problem Language Result Execution time Memory
947035 2024-03-15T11:57:49 Z adaptatron Rabbit Carrot (LMIO19_triusis) C++17
63 / 100
 1000 ms 2392 KB 
#include <bits/stdc++.h>
using namespace std;

const int inf = 1e5;

void solve(vector<int> &a, int m) {
    a.insert(a.begin(), 0);
    int n = a.size();

    // dp[i] is the minimum number of operations on the prefix [0 ... i]
    // such that the i-th element is retained.
    vector<int> dp(n, inf);
    dp[0] = 0;

    for (int i = 0; i < n; i++) {
        for (int j = i - 1; j >= 0; j--) {
            // Assume that j is the second last retained element.
            if (a[i] - a[j] <= (i - j) * m) {
                dp[i] = min(dp[i], dp[j] + i - j - 1);
            }
        }
    }

    int ans = n;
    for (int i = 0; i < n; i++) {
        // i-th element is the last retained element, all elements to the
        // right are deleted.
        ans = min(ans, dp[i] + (n - 1 - i));
    }

    cout << ans << endl;
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    solve(a, m);
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 10 ms 492 KB Output is correct
21 Correct 15 ms 348 KB Output is correct
22 Correct 35 ms 348 KB Output is correct
23 Correct 16 ms 348 KB Output is correct
24 Correct 19 ms 348 KB Output is correct
25 Correct 16 ms 348 KB Output is correct
26 Correct 16 ms 476 KB Output is correct
27 Correct 16 ms 348 KB Output is correct
28 Correct 16 ms 344 KB Output is correct
29 Correct 19 ms 344 KB Output is correct
30 Correct 15 ms 348 KB Output is correct
31 Correct 12 ms 348 KB Output is correct
32 Correct 16 ms 496 KB Output is correct
33 Correct 15 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 10 ms 492 KB Output is correct
5 Correct 15 ms 348 KB Output is correct
6 Correct 35 ms 348 KB Output is correct
7 Correct 16 ms 348 KB Output is correct
8 Correct 19 ms 348 KB Output is correct
9 Correct 16 ms 348 KB Output is correct
10 Correct 16 ms 476 KB Output is correct
11 Correct 16 ms 348 KB Output is correct
12 Correct 16 ms 344 KB Output is correct
13 Correct 19 ms 344 KB Output is correct
14 Correct 15 ms 348 KB Output is correct
15 Correct 12 ms 348 KB Output is correct
16 Correct 16 ms 496 KB Output is correct
17 Correct 15 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 432 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 432 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 36 ms 348 KB Output is correct
35 Correct 36 ms 344 KB Output is correct
36 Correct 36 ms 344 KB Output is correct
37 Correct 16 ms 344 KB Output is correct
38 Correct 16 ms 348 KB Output is correct
39 Correct 16 ms 348 KB Output is correct
40 Correct 14 ms 348 KB Output is correct
41 Correct 16 ms 348 KB Output is correct
42 Correct 16 ms 600 KB Output is correct
43 Correct 17 ms 348 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 348 KB Output is correct
2 Correct 36 ms 344 KB Output is correct
3 Correct 36 ms 344 KB Output is correct
4 Correct 16 ms 344 KB Output is correct
5 Correct 16 ms 348 KB Output is correct
6 Correct 16 ms 348 KB Output is correct
7 Correct 14 ms 348 KB Output is correct
8 Correct 16 ms 348 KB Output is correct
9 Correct 16 ms 600 KB Output is correct
10 Correct 17 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 10 ms 492 KB Output is correct
15 Correct 15 ms 348 KB Output is correct
16 Correct 35 ms 348 KB Output is correct
17 Correct 16 ms 348 KB Output is correct
18 Correct 19 ms 348 KB Output is correct
19 Correct 16 ms 348 KB Output is correct
20 Correct 16 ms 476 KB Output is correct
21 Correct 16 ms 348 KB Output is correct
22 Correct 16 ms 344 KB Output is correct
23 Correct 19 ms 344 KB Output is correct
24 Correct 15 ms 348 KB Output is correct
25 Correct 12 ms 348 KB Output is correct
26 Correct 16 ms 496 KB Output is correct
27 Correct 15 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 432 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 432 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Execution timed out 1060 ms 2392 KB Time limit exceeded
45 Halted 0 ms 0 KB -