oj.uz

Submission #770895

# Submission time Handle Problem Language Result Execution time Memory
770895 2023-07-02T05:50:18 Z drdilyor Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1000 ms 516 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9;

int main() {
    int n, m;
    cin >> n >> m;
    n++;
    vector<int> arr(n);
    for (int i = 1; i < n; i++) 
        cin >> arr[i];

    const int M = 5e3;

    vector memo(n, vector(M+1, -1));
    auto dp = [&](auto& dp, int i, int x)->int {
        if (x < 0) return inf;
        if (x > M) return inf;
        if (i == 0) {
            return x== arr[i] ? 0 : inf;
        }
        if (memo[i][x] != -1) return memo[i][x];

        int res = inf;
        for (int p = x-m; p <= x+m; p++) {
            res = min(res, dp(dp, i-1, p) + (x != arr[i]));
        }
        return memo[i][x] = res;
    };

    int res = inf;
    for (int i = 0; i <= M; i++)
        res = min(res, dp(dp, n-1, i));
    cout << res << '\n';

    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Execution timed out 1073 ms 516 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Execution timed out 1073 ms 516 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Execution timed out 1073 ms 516 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Execution timed out 1073 ms 516 KB Time limit exceeded
10 Halted 0 ms 0 KB -