oj.uz

Submission #412910

# Submission time Handle Problem Language Result Execution time Memory
412910 2021-05-27T19:07:08 Z Tc14 The short shank; Redemption (BOI21_prison) C++17
15 / 100
 2000 ms 8140 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 10;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, d, t;
    ve<int> T;
    ve<ve<int>> DP;

    cin >> n >> d >> t;
    T = ve<int>(n);
    DP = ve<ve<int>>(d + 1, ve<int>(n, INF));

    for (int i = 0; i < n; i++) {
        cin >> T[i];
    }

    DP[0][n - 1] = 0;

    for (int i = 1; i <= d; i++) {
        for (int j = n - 2; j >= 0; j--) {

            int z = INF;
            int cnt = 0;
            for (int k = j + 1; k < n; k++) {

                if (T[k] <= t || z <= t) cnt++;
                z = min(z, T[k]);
                z++;

                DP[i][j] = min(DP[i][j], DP[i - 1][k] + cnt);
            }
        }
    }

    int ans = INF;
    int z = INF;
    int cnt = 0;
    for (int i = 0; i < n; i++) {

        if (T[i] <= t || z <= t) cnt++;
        z = min(z, T[i]);
        z++;

        ans = min(ans, DP[d][i] + cnt);
    }
    cout << ans << endl;

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 316 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 15 ms 420 KB Output is correct
5 Correct 30 ms 460 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 11 ms 392 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 14 ms 332 KB Output is correct
11 Correct 27 ms 460 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Execution timed out 2073 ms 8140 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 316 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 15 ms 420 KB Output is correct
5 Correct 30 ms 460 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 11 ms 392 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 14 ms 332 KB Output is correct
11 Correct 27 ms 460 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 6 ms 356 KB Output is correct
15 Correct 16 ms 316 KB Output is correct
16 Correct 28 ms 520 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 11 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 6 ms 332 KB Output is correct
21 Correct 14 ms 424 KB Output is correct
22 Correct 27 ms 460 KB Output is correct
23 Execution timed out 2079 ms 1860 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Execution timed out 2067 ms 5992 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 316 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 15 ms 420 KB Output is correct
5 Correct 30 ms 460 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 11 ms 392 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 14 ms 332 KB Output is correct
11 Correct 27 ms 460 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 6 ms 356 KB Output is correct
15 Correct 16 ms 316 KB Output is correct
16 Correct 28 ms 520 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 11 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 6 ms 332 KB Output is correct
21 Correct 14 ms 424 KB Output is correct
22 Correct 27 ms 460 KB Output is correct
23 Execution timed out 2079 ms 1860 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 316 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 15 ms 420 KB Output is correct
5 Correct 30 ms 460 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 11 ms 392 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 14 ms 332 KB Output is correct
11 Correct 27 ms 460 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Execution timed out 2073 ms 8140 KB Time limit exceeded
14 Halted 0 ms 0 KB -