oj.uz

Submission #970995

# Submission time Handle Problem Language Result Execution time Memory
970995 2024-04-27T18:07:56 Z vladilius The short shank; Redemption (BOI21_prison) C++17
55 / 100
 662 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = numeric_limits<int> :: max();

struct ST{
    vector<int> t, p;
    int n;
    ST(int ns){
        n = ns;
        t.resize(4 * n);
        p.resize(4 * n);
    }
    void push(int& v, int& vv){
        if (!p[v]) return;
        p[vv] += p[v]; t[vv] += p[v];
        p[vv + 1] += p[v]; t[vv + 1] += p[v];
        p[v] = 0;
    }
    void add(int v, int tl, int tr, int& l, int& r, int& x){
        if (l > tr || r < tl) return;
        if (l <= tl && tr <= r){
            t[v] += x;
            p[v] += x;
            return;
        }
        int tm = (tl + tr) / 2, vv = 2 * v;
        push(v, vv);
        add(vv, tl, tm, l, r, x);
        add(vv + 1, tm + 1, tr, l, r, x);
        t[v] = min(t[vv], t[vv + 1]);
    }
    void add(int l, int r, int x){
        if (l > r) return;
        add(1, 1, n, l, r, x);
    }
    int get(int v, int tl, int tr, int& l, int& r){
        if (l > tr || r < tl) return inf;
        if (l <= tl && tr <= r){
            return t[v];
        }
        int tm = (tl + tr) / 2, vv = 2 * v;
        push(v, vv);
        return min(get(vv, tl, tm, l, r), get(vv + 1, tm + 1, tr, l, r));
    }
    int get(int l, int r){
        if (l > r) return inf;
        return get(1, 1, n, l, r);
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, d, t; cin>>n>>d>>t;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++){
        cin>>a[i];
    }
    vector<int> h(n + 1);
    priority_queue<int, vector<int>, greater<int>> pq;
    int tt = 0, cnt = 0;
    for (int j = 1; j <= n; j++){
        pq.push(a[j] - tt);
        int m = pq.top() + tt;
        cnt += (m <= t);
        h[j] = cnt;
        tt++;
    }
    
    vector<int> r(n + 1);
    for (int i = 1; i <= n; i++){
        if (a[i] > t) continue;
        int m = t - a[i];
        r[i] = i + m;
    }
    
    const int lg = ceil(log2(n));
    vector<vector<int>> sp(n + 1, vector<int>(lg));
    for (int i = 1; i <= n; i++){
        sp[i][0] = r[i];
    }
    for (int j = 1; j < lg; j++){
        for (int i = 1; i + (1 << j) <= n + 1; i++){
            sp[i][j] = max(sp[i][j - 1], sp[i + (1 << (j - 1))][j - 1]);
        }
    }
    vector<int> log(n + 1);
    for (int i = 2; i <= n; i++){
        log[i] = log[i / 2] + 1;
    }
    
    auto check = [&](int x, int y){
        int k = log[y - x + 1];
        return max(sp[x][k], sp[y - (1 << k) + 1][k]) >= y;
    };
    
    vector<int> f(n);
    for (int i = 1; i < n; i++){
        auto good = [&](int m){
            return check(m, i + 1);
        };
        int l = 0, r = i + 1;
        while (l + 1 < r){
            int m = (l + r) / 2;
            if (good(m)){
                l = m;
            }
            else {
                r = m - 1;
            }
        }
        if (good(r)) l = r;
        f[i] = l;
    }
 
    vector<vector<int>> dp(n + 1, vector<int>(d + 1));
    for (int i = 1; i <= n; i++){
        dp[i][0] = h[i];
    }
    for (int k = 1; k <= d; k++){
        ST T(n);
        for (int i = 1; i <= n; i++){
            T.add(1, f[i - 1] - 1, 1);
            dp[i][k] = min(dp[i][k - 1], T.get(1, i - 1));
            T.add(i, i, dp[i][k - 1]);
        }
    }

    cout<<dp[n][d]<<"\n";
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 12 ms 604 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 6 ms 648 KB Output is correct
11 Correct 11 ms 744 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 484 ms 116840 KB Output is correct
3 Correct 500 ms 118736 KB Output is correct
4 Correct 474 ms 117448 KB Output is correct
5 Correct 459 ms 115660 KB Output is correct
6 Correct 452 ms 117904 KB Output is correct
7 Correct 423 ms 117708 KB Output is correct
8 Correct 451 ms 117904 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 12 ms 604 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 6 ms 648 KB Output is correct
11 Correct 11 ms 744 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 6 ms 600 KB Output is correct
16 Correct 12 ms 604 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 5 ms 604 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 6 ms 652 KB Output is correct
22 Correct 13 ms 604 KB Output is correct
23 Correct 128 ms 2764 KB Output is correct
24 Correct 257 ms 4188 KB Output is correct
25 Correct 383 ms 5724 KB Output is correct
26 Correct 510 ms 7468 KB Output is correct
27 Correct 644 ms 9048 KB Output is correct
28 Correct 78 ms 2140 KB Output is correct
29 Correct 92 ms 2136 KB Output is correct
30 Correct 136 ms 3056 KB Output is correct
31 Correct 288 ms 5124 KB Output is correct
32 Correct 148 ms 3060 KB Output is correct
33 Correct 151 ms 2908 KB Output is correct
34 Correct 65 ms 1992 KB Output is correct
35 Correct 659 ms 9008 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 501 ms 20328 KB Output is correct
3 Correct 519 ms 20844 KB Output is correct
4 Correct 507 ms 20300 KB Output is correct
5 Correct 479 ms 20560 KB Output is correct
6 Correct 488 ms 20716 KB Output is correct
7 Correct 428 ms 20500 KB Output is correct
8 Correct 409 ms 20312 KB Output is correct
9 Correct 480 ms 20444 KB Output is correct
10 Correct 474 ms 20364 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 12 ms 604 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 6 ms 648 KB Output is correct
11 Correct 11 ms 744 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 6 ms 600 KB Output is correct
16 Correct 12 ms 604 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 5 ms 604 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 6 ms 652 KB Output is correct
22 Correct 13 ms 604 KB Output is correct
23 Correct 128 ms 2764 KB Output is correct
24 Correct 257 ms 4188 KB Output is correct
25 Correct 383 ms 5724 KB Output is correct
26 Correct 510 ms 7468 KB Output is correct
27 Correct 644 ms 9048 KB Output is correct
28 Correct 78 ms 2140 KB Output is correct
29 Correct 92 ms 2136 KB Output is correct
30 Correct 136 ms 3056 KB Output is correct
31 Correct 288 ms 5124 KB Output is correct
32 Correct 148 ms 3060 KB Output is correct
33 Correct 151 ms 2908 KB Output is correct
34 Correct 65 ms 1992 KB Output is correct
35 Correct 659 ms 9008 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 501 ms 20328 KB Output is correct
38 Correct 519 ms 20844 KB Output is correct
39 Correct 507 ms 20300 KB Output is correct
40 Correct 479 ms 20560 KB Output is correct
41 Correct 488 ms 20716 KB Output is correct
42 Correct 428 ms 20500 KB Output is correct
43 Correct 409 ms 20312 KB Output is correct
44 Correct 480 ms 20444 KB Output is correct
45 Correct 474 ms 20364 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 2 ms 348 KB Output is correct
49 Correct 6 ms 604 KB Output is correct
50 Correct 12 ms 748 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 5 ms 604 KB Output is correct
53 Correct 2 ms 348 KB Output is correct
54 Correct 3 ms 348 KB Output is correct
55 Correct 6 ms 656 KB Output is correct
56 Correct 11 ms 604 KB Output is correct
57 Correct 139 ms 2760 KB Output is correct
58 Correct 264 ms 4324 KB Output is correct
59 Correct 406 ms 5896 KB Output is correct
60 Correct 517 ms 7508 KB Output is correct
61 Correct 641 ms 9028 KB Output is correct
62 Correct 78 ms 2148 KB Output is correct
63 Correct 90 ms 2324 KB Output is correct
64 Correct 136 ms 3056 KB Output is correct
65 Correct 286 ms 5124 KB Output is correct
66 Correct 146 ms 3056 KB Output is correct
67 Correct 149 ms 2904 KB Output is correct
68 Correct 74 ms 1984 KB Output is correct
69 Correct 662 ms 8792 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 492 ms 20576 KB Output is correct
72 Correct 501 ms 20692 KB Output is correct
73 Correct 482 ms 20300 KB Output is correct
74 Correct 494 ms 20824 KB Output is correct
75 Correct 494 ms 20648 KB Output is correct
76 Correct 416 ms 20368 KB Output is correct
77 Correct 414 ms 20624 KB Output is correct
78 Correct 489 ms 20600 KB Output is correct
79 Correct 495 ms 20604 KB Output is correct
80 Runtime error 255 ms 524288 KB Execution killed with signal 9
81 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 12 ms 604 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 6 ms 648 KB Output is correct
11 Correct 11 ms 744 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 484 ms 116840 KB Output is correct
14 Correct 500 ms 118736 KB Output is correct
15 Correct 474 ms 117448 KB Output is correct
16 Correct 459 ms 115660 KB Output is correct
17 Correct 452 ms 117904 KB Output is correct
18 Correct 423 ms 117708 KB Output is correct
19 Correct 451 ms 117904 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 6 ms 600 KB Output is correct
24 Correct 12 ms 604 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 5 ms 604 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 6 ms 652 KB Output is correct
30 Correct 13 ms 604 KB Output is correct
31 Correct 128 ms 2764 KB Output is correct
32 Correct 257 ms 4188 KB Output is correct
33 Correct 383 ms 5724 KB Output is correct
34 Correct 510 ms 7468 KB Output is correct
35 Correct 644 ms 9048 KB Output is correct
36 Correct 78 ms 2140 KB Output is correct
37 Correct 92 ms 2136 KB Output is correct
38 Correct 136 ms 3056 KB Output is correct
39 Correct 288 ms 5124 KB Output is correct
40 Correct 148 ms 3060 KB Output is correct
41 Correct 151 ms 2908 KB Output is correct
42 Correct 65 ms 1992 KB Output is correct
43 Correct 659 ms 9008 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 501 ms 20328 KB Output is correct
46 Correct 519 ms 20844 KB Output is correct
47 Correct 507 ms 20300 KB Output is correct
48 Correct 479 ms 20560 KB Output is correct
49 Correct 488 ms 20716 KB Output is correct
50 Correct 428 ms 20500 KB Output is correct
51 Correct 409 ms 20312 KB Output is correct
52 Correct 480 ms 20444 KB Output is correct
53 Correct 474 ms 20364 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 2 ms 348 KB Output is correct
57 Correct 6 ms 604 KB Output is correct
58 Correct 12 ms 748 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 5 ms 604 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 3 ms 348 KB Output is correct
63 Correct 6 ms 656 KB Output is correct
64 Correct 11 ms 604 KB Output is correct
65 Correct 139 ms 2760 KB Output is correct
66 Correct 264 ms 4324 KB Output is correct
67 Correct 406 ms 5896 KB Output is correct
68 Correct 517 ms 7508 KB Output is correct
69 Correct 641 ms 9028 KB Output is correct
70 Correct 78 ms 2148 KB Output is correct
71 Correct 90 ms 2324 KB Output is correct
72 Correct 136 ms 3056 KB Output is correct
73 Correct 286 ms 5124 KB Output is correct
74 Correct 146 ms 3056 KB Output is correct
75 Correct 149 ms 2904 KB Output is correct
76 Correct 74 ms 1984 KB Output is correct
77 Correct 662 ms 8792 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 492 ms 20576 KB Output is correct
80 Correct 501 ms 20692 KB Output is correct
81 Correct 482 ms 20300 KB Output is correct
82 Correct 494 ms 20824 KB Output is correct
83 Correct 494 ms 20648 KB Output is correct
84 Correct 416 ms 20368 KB Output is correct
85 Correct 414 ms 20624 KB Output is correct
86 Correct 489 ms 20600 KB Output is correct
87 Correct 495 ms 20604 KB Output is correct
88 Runtime error 255 ms 524288 KB Execution killed with signal 9
89 Halted 0 ms 0 KB -