oj.uz

Submission #940515

# Submission time Handle Problem Language Result Execution time Memory
940515 2024-03-07T10:10:05 Z LucaIlie The short shank; Redemption (BOI21_prison) C++17
70 / 100
 863 ms 10164 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 7.5e4;
const long long INF = 1e9;

int groups[MAX_N + 1], firstLower[MAX_N + 1];
long long t[MAX_N + 1];
long long minPrisoners[MAX_N + 1];

struct info {
    long long minn;
    int pos;

    bool operator < ( const info &x ) const {
        return minn < x.minn;
    }
};

struct SegTree {
    int n, ls, rs;
    info segTree[4 * MAX_N];
    long long lazy[4 * MAX_N];

    void init( int v, int l, int r ) {
        lazy[v] = 0;
        if ( l == r ) {
            segTree[v] = { 0, l };
            return;
        }
        int mid = (l + r) / 2;
        init( v * 2 + 1, l, mid );
        init( v * 2 + 2, mid + 1, r );
        segTree[v] = min( segTree[v * 2 + 1], segTree[v * 2 + 2] );
    }

    void init( int _ls, int _rs ) {
        ls = _ls;
        rs = _rs;
        n = rs - ls + 1;
        init( 0, ls, rs );
    }

    void propag( int v, int l, int r ) {
        segTree[v].minn += 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, long long 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, long long x ) {
        update( 0, ls, rs, l, r, x );
    }

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

        if ( l > rq || r < lq )
            return { INF, 0 };

        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() {
    //ifstream cin( ".in" );
    cin.tie( NULL );
    cout.tie( NULL );
    ios_base::sync_with_stdio( false );
    int n, d, s;

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

    vector<int> stack;
    stack.push_back( 0 );
    for ( int i = 1; i <= n; i++ ) {
        while ( t[i] <= t[stack.back()] )
            stack.pop_back();
        stack.push_back( i );

        int l = 0, r = stack.size();
        while ( r - l > 1 ) {
            int mid = (l + r) / 2;

            if ( t[stack[mid]] <= s - i )
                l = mid;
            else
                r = mid;
        }
        firstLower[i] = stack[l];
    }


    int lc = 0, rc = 1e6;
    while ( rc - lc > 1 ) {
        int cost = (rc + lc) / 2;

        //cout << lc << " " << rc << "\n";
        prisoners.init( 1, n );
        for ( int i = 1; i <= n; i++ ) {
            prisoners.update( i, i, minPrisoners[i - 1] + cost );
            prisoners.update( 1, firstLower[i], 1 );

            auto x = prisoners.query( 0, 1, n, 1, i );
            minPrisoners[i] = x.minn;
            groups[i] = groups[x.pos - 1] + 1;
        }

        if ( groups[n] > d )
            lc = cost;
        else
            rc = cost;
    }
    int cost = rc;
    prisoners.init( 1, n );
    for ( int i = 1; i <= n; i++ ) {
        prisoners.update( i, i, minPrisoners[i - 1] + cost );
        prisoners.update( 1, firstLower[i], 1 );

        auto x = prisoners.query( 0, 1, n, 1, i );
        minPrisoners[i] = x.minn;
        groups[i] = groups[x.pos] + 1;
    }

    cout << minPrisoners[n] - d * cost;

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 4 ms 4444 KB Output is correct
4 Correct 4 ms 4440 KB Output is correct
5 Correct 4 ms 4588 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 4 ms 4440 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Runtime error 13 ms 5468 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 1 ms 4440 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 4 ms 4444 KB Output is correct
4 Correct 4 ms 4440 KB Output is correct
5 Correct 4 ms 4588 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 4 ms 4440 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct
12 Correct 2 ms 4440 KB Output is correct
13 Correct 3 ms 4444 KB Output is correct
14 Correct 3 ms 4588 KB Output is correct
15 Correct 4 ms 4444 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Correct 4 ms 4444 KB Output is correct
18 Correct 4 ms 4440 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 3 ms 4444 KB Output is correct
21 Correct 3 ms 4444 KB Output is correct
22 Correct 4 ms 4444 KB Output is correct
23 Correct 33 ms 4712 KB Output is correct
24 Correct 32 ms 4700 KB Output is correct
25 Correct 32 ms 4700 KB Output is correct
26 Correct 32 ms 4700 KB Output is correct
27 Correct 33 ms 4696 KB Output is correct
28 Correct 32 ms 4700 KB Output is correct
29 Correct 32 ms 4700 KB Output is correct
30 Correct 31 ms 4704 KB Output is correct
31 Correct 29 ms 4700 KB Output is correct
32 Correct 29 ms 4696 KB Output is correct
33 Correct 30 ms 4696 KB Output is correct
34 Correct 33 ms 4700 KB Output is correct
35 Correct 31 ms 4696 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 754 ms 9004 KB Output is correct
3 Correct 788 ms 9976 KB Output is correct
4 Correct 778 ms 9796 KB Output is correct
5 Correct 791 ms 9996 KB Output is correct
6 Correct 777 ms 9980 KB Output is correct
7 Correct 665 ms 9732 KB Output is correct
8 Correct 657 ms 9808 KB Output is correct
9 Correct 684 ms 9812 KB Output is correct
10 Correct 698 ms 9556 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 4 ms 4444 KB Output is correct
4 Correct 4 ms 4440 KB Output is correct
5 Correct 4 ms 4588 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 4 ms 4440 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct
12 Correct 2 ms 4440 KB Output is correct
13 Correct 3 ms 4444 KB Output is correct
14 Correct 3 ms 4588 KB Output is correct
15 Correct 4 ms 4444 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Correct 4 ms 4444 KB Output is correct
18 Correct 4 ms 4440 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 3 ms 4444 KB Output is correct
21 Correct 3 ms 4444 KB Output is correct
22 Correct 4 ms 4444 KB Output is correct
23 Correct 33 ms 4712 KB Output is correct
24 Correct 32 ms 4700 KB Output is correct
25 Correct 32 ms 4700 KB Output is correct
26 Correct 32 ms 4700 KB Output is correct
27 Correct 33 ms 4696 KB Output is correct
28 Correct 32 ms 4700 KB Output is correct
29 Correct 32 ms 4700 KB Output is correct
30 Correct 31 ms 4704 KB Output is correct
31 Correct 29 ms 4700 KB Output is correct
32 Correct 29 ms 4696 KB Output is correct
33 Correct 30 ms 4696 KB Output is correct
34 Correct 33 ms 4700 KB Output is correct
35 Correct 31 ms 4696 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 754 ms 9004 KB Output is correct
38 Correct 788 ms 9976 KB Output is correct
39 Correct 778 ms 9796 KB Output is correct
40 Correct 791 ms 9996 KB Output is correct
41 Correct 777 ms 9980 KB Output is correct
42 Correct 665 ms 9732 KB Output is correct
43 Correct 657 ms 9808 KB Output is correct
44 Correct 684 ms 9812 KB Output is correct
45 Correct 698 ms 9556 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 4 ms 4444 KB Output is correct
48 Correct 4 ms 4444 KB Output is correct
49 Correct 4 ms 4444 KB Output is correct
50 Correct 4 ms 4444 KB Output is correct
51 Correct 4 ms 4444 KB Output is correct
52 Correct 4 ms 4444 KB Output is correct
53 Correct 4 ms 4444 KB Output is correct
54 Correct 4 ms 4444 KB Output is correct
55 Correct 4 ms 4440 KB Output is correct
56 Correct 4 ms 4444 KB Output is correct
57 Correct 33 ms 4568 KB Output is correct
58 Correct 32 ms 4736 KB Output is correct
59 Correct 32 ms 4696 KB Output is correct
60 Correct 36 ms 4696 KB Output is correct
61 Correct 33 ms 4952 KB Output is correct
62 Correct 34 ms 4700 KB Output is correct
63 Correct 32 ms 4696 KB Output is correct
64 Correct 29 ms 4700 KB Output is correct
65 Correct 36 ms 4700 KB Output is correct
66 Correct 29 ms 4700 KB Output is correct
67 Correct 29 ms 4736 KB Output is correct
68 Correct 32 ms 4696 KB Output is correct
69 Correct 31 ms 4700 KB Output is correct
70 Correct 1 ms 4444 KB Output is correct
71 Correct 747 ms 9724 KB Output is correct
72 Correct 787 ms 10064 KB Output is correct
73 Correct 769 ms 9804 KB Output is correct
74 Correct 779 ms 9992 KB Output is correct
75 Correct 794 ms 10164 KB Output is correct
76 Correct 648 ms 9760 KB Output is correct
77 Correct 641 ms 9560 KB Output is correct
78 Correct 683 ms 9804 KB Output is correct
79 Correct 730 ms 9808 KB Output is correct
80 Correct 798 ms 10068 KB Output is correct
81 Correct 812 ms 9972 KB Output is correct
82 Correct 741 ms 9980 KB Output is correct
83 Correct 809 ms 9804 KB Output is correct
84 Correct 810 ms 9456 KB Output is correct
85 Correct 831 ms 9984 KB Output is correct
86 Correct 688 ms 9524 KB Output is correct
87 Correct 654 ms 9756 KB Output is correct
88 Correct 707 ms 9764 KB Output is correct
89 Correct 800 ms 9768 KB Output is correct
90 Correct 863 ms 9760 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 4 ms 4444 KB Output is correct
4 Correct 4 ms 4440 KB Output is correct
5 Correct 4 ms 4588 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 4 ms 4440 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Runtime error 13 ms 5468 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -