oj.uz

Submission #939655

# Submission time Handle Problem Language Result Execution time Memory
939655 2024-03-06T16:07:07 Z LucaIlie The short shank; Redemption (BOI21_prison) C++17
35 / 100
 782 ms 107600 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 4000;
const int MAX_D = MAX_N;
const int INF = MAX_N + 1;

int minPrisoners[MAX_N + 1][MAX_D + 1], t[MAX_N + 1], firstLower[MAX_N + 1];

struct SegTree {
    int n, ls, rs;
    vector<int> segTree, lazy;

    void init( int _n, int _ls, int _rs ) {
        n = _n;
        ls = _ls;
        rs = _rs;
        segTree.resize( 4 * n );
        lazy.resize( 4 * n );
        for ( int v = 0; v < 4 * n; v++ )
            segTree[v] = lazy[v] = 0;
    }

    void propag( int v, int l, int r ) {
        segTree[v] += lazy[v];
        if ( l != r ) {
            lazy[v * 2 + 1] += lazy[v];
            lazy[v * 2 + 2] += lazy[v];
        }
        lazy[v] = 0;
    }

    void update( int v, int l, int r, int lu, int ru, int x ) {
        propag( v, l, r );

        if ( l > ru || r < lu )
            return;

        if ( lu <= l && r <= ru ) {
            lazy[v] += x;
            propag( v, l, r );
            return;
        }

        int mid = (l + r) / 2;
        update( v * 2 + 1, l, mid, lu, ru, x );
        update( v * 2 + 2, mid + 1, r, lu, ru, x );
        segTree[v] = min( segTree[v * 2 + 1], segTree[v * 2 + 2] );
    }

    void update( int l, int r, int x ) {
        update( 0, ls, rs, l, r, x );
    }

    int query( int v, int l, int r, int lq, int rq ) {
        propag( v, l, r );

        if ( l > rq || r < lq )
            return INF;

        if ( lq <= l && r <= rq )
            return segTree[v];

        int mid = (l + r) / 2;
        return min( query( v * 2 + 1, l, mid, lq, rq ), query( v * 2 + 2, mid + 1, r, lq, rq ) );
    }
} prisoners;

int main() {
    int n, d, s;

    cin >> n >> d >> s;
    d++;
    for ( int i = 1; i <= n; i++ ) {
        cin >> t[i];
        t[i] -= i;
    }

    for ( int i = 1; i <= n; i++ ) {
        for ( int j = i; j >= 1; j-- ) {
            if ( t[j] <= s - i ) {
                firstLower[i] = j;
                break;
            }
        }
    }

    minPrisoners[0][0] = 0;
    for ( int i = 1; i <= n; i++ )
        minPrisoners[i][0] = INF;
    for ( int k = 1; k <= d; k++ ) {
        minPrisoners[0][k] = INF;
        prisoners.init( n, 1, n );
        for ( int i = 1; i <= n; i++ ) {
            prisoners.update( i, i, minPrisoners[i - 1][k - 1] );
            int minT = s;

            prisoners.update( 1, firstLower[i], 1 );

            minPrisoners[i][k] = prisoners.query( 0, 1, n, 1, i );
        }
    }

    cout << minPrisoners[n][d] << "\n";

    return 0;
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:97:17: warning: unused variable 'minT' [-Wunused-variable]
   97 |             int minT = s;
      |                 ^~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 7 ms 8540 KB Output is correct
5 Correct 14 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 9 ms 8536 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 20 ms 8536 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 198 ms 107600 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 7 ms 8540 KB Output is correct
5 Correct 14 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 9 ms 8536 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 20 ms 8536 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 3 ms 8536 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 12 ms 8540 KB Output is correct
16 Correct 14 ms 8708 KB Output is correct
17 Correct 3 ms 8540 KB Output is correct
18 Correct 6 ms 8540 KB Output is correct
19 Correct 4 ms 8676 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 7 ms 8540 KB Output is correct
22 Correct 12 ms 8708 KB Output is correct
23 Correct 158 ms 47476 KB Output is correct
24 Correct 317 ms 47232 KB Output is correct
25 Correct 455 ms 48780 KB Output is correct
26 Correct 616 ms 49372 KB Output is correct
27 Correct 782 ms 48448 KB Output is correct
28 Correct 100 ms 47440 KB Output is correct
29 Correct 121 ms 47760 KB Output is correct
30 Correct 173 ms 52048 KB Output is correct
31 Correct 348 ms 52500 KB Output is correct
32 Correct 207 ms 52020 KB Output is correct
33 Correct 179 ms 52052 KB Output is correct
34 Correct 82 ms 51804 KB Output is correct
35 Correct 776 ms 52292 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 75 ms 104360 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 7 ms 8540 KB Output is correct
5 Correct 14 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 9 ms 8536 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 20 ms 8536 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 3 ms 8536 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 12 ms 8540 KB Output is correct
16 Correct 14 ms 8708 KB Output is correct
17 Correct 3 ms 8540 KB Output is correct
18 Correct 6 ms 8540 KB Output is correct
19 Correct 4 ms 8676 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 7 ms 8540 KB Output is correct
22 Correct 12 ms 8708 KB Output is correct
23 Correct 158 ms 47476 KB Output is correct
24 Correct 317 ms 47232 KB Output is correct
25 Correct 455 ms 48780 KB Output is correct
26 Correct 616 ms 49372 KB Output is correct
27 Correct 782 ms 48448 KB Output is correct
28 Correct 100 ms 47440 KB Output is correct
29 Correct 121 ms 47760 KB Output is correct
30 Correct 173 ms 52048 KB Output is correct
31 Correct 348 ms 52500 KB Output is correct
32 Correct 207 ms 52020 KB Output is correct
33 Correct 179 ms 52052 KB Output is correct
34 Correct 82 ms 51804 KB Output is correct
35 Correct 776 ms 52292 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Runtime error 75 ms 104360 KB Execution killed with signal 11
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 7 ms 8540 KB Output is correct
5 Correct 14 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 9 ms 8536 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 20 ms 8536 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Runtime error 198 ms 107600 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -