oj.uz

Submission #970964

# Submission time Handle Problem Language Result Execution time Memory
970964 2024-04-27T16:06:52 Z vladilius The short shank; Redemption (BOI21_prison) C++17
35 / 100
 790 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<vector<int>> h(n + 1, vector<int>(n + 1));
    for (int i = 1; i <= n; i++){
        priority_queue<int, vector<int>, greater<int>> pq;
        int tt = 0, cnt = 0;
        for (int j = i; j <= n; j++){
            pq.push(a[j] - tt);
            int m = pq.top() + tt;
            cnt += (m <= t);
            h[i][j] = cnt;
            tt++;
        }
    }
    
    vector<int> f(n);
    for (int i = 1; i < n; i++){
        int j = 2;
        while (j <= n && h[j][i] != h[j][i + 1]){
            j++;
        }
        f[i] = j - 1;
    }
 
    vector<vector<int>> dp(n + 1, vector<int>(d + 1));
    for (int i = 1; i <= n; i++){
        dp[i][0] = h[1][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 1 ms 344 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 4 ms 1112 KB Output is correct
4 Correct 8 ms 1368 KB Output is correct
5 Correct 14 ms 1628 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 7 ms 1372 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 5 ms 1536 KB Output is correct
10 Correct 8 ms 1372 KB Output is correct
11 Correct 13 ms 1628 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 4 ms 1112 KB Output is correct
4 Correct 8 ms 1368 KB Output is correct
5 Correct 14 ms 1628 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 7 ms 1372 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 5 ms 1536 KB Output is correct
10 Correct 8 ms 1372 KB Output is correct
11 Correct 13 ms 1628 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 3 ms 1112 KB Output is correct
14 Correct 4 ms 1148 KB Output is correct
15 Correct 8 ms 1604 KB Output is correct
16 Correct 14 ms 1624 KB Output is correct
17 Correct 4 ms 1372 KB Output is correct
18 Correct 7 ms 1372 KB Output is correct
19 Correct 4 ms 1372 KB Output is correct
20 Correct 5 ms 1624 KB Output is correct
21 Correct 8 ms 1372 KB Output is correct
22 Correct 15 ms 1696 KB Output is correct
23 Correct 304 ms 65160 KB Output is correct
24 Correct 421 ms 66644 KB Output is correct
25 Correct 541 ms 68276 KB Output is correct
26 Correct 670 ms 69968 KB Output is correct
27 Correct 790 ms 71504 KB Output is correct
28 Correct 260 ms 64340 KB Output is correct
29 Correct 275 ms 64588 KB Output is correct
30 Correct 297 ms 65360 KB Output is correct
31 Correct 444 ms 67516 KB Output is correct
32 Correct 288 ms 65356 KB Output is correct
33 Correct 302 ms 65352 KB Output is correct
34 Correct 254 ms 64340 KB Output is correct
35 Correct 790 ms 71396 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 4 ms 1112 KB Output is correct
4 Correct 8 ms 1368 KB Output is correct
5 Correct 14 ms 1628 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 7 ms 1372 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 5 ms 1536 KB Output is correct
10 Correct 8 ms 1372 KB Output is correct
11 Correct 13 ms 1628 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 3 ms 1112 KB Output is correct
14 Correct 4 ms 1148 KB Output is correct
15 Correct 8 ms 1604 KB Output is correct
16 Correct 14 ms 1624 KB Output is correct
17 Correct 4 ms 1372 KB Output is correct
18 Correct 7 ms 1372 KB Output is correct
19 Correct 4 ms 1372 KB Output is correct
20 Correct 5 ms 1624 KB Output is correct
21 Correct 8 ms 1372 KB Output is correct
22 Correct 15 ms 1696 KB Output is correct
23 Correct 304 ms 65160 KB Output is correct
24 Correct 421 ms 66644 KB Output is correct
25 Correct 541 ms 68276 KB Output is correct
26 Correct 670 ms 69968 KB Output is correct
27 Correct 790 ms 71504 KB Output is correct
28 Correct 260 ms 64340 KB Output is correct
29 Correct 275 ms 64588 KB Output is correct
30 Correct 297 ms 65360 KB Output is correct
31 Correct 444 ms 67516 KB Output is correct
32 Correct 288 ms 65356 KB Output is correct
33 Correct 302 ms 65352 KB Output is correct
34 Correct 254 ms 64340 KB Output is correct
35 Correct 790 ms 71396 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Runtime error 195 ms 524288 KB Execution killed with signal 9
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 4 ms 1112 KB Output is correct
4 Correct 8 ms 1368 KB Output is correct
5 Correct 14 ms 1628 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 7 ms 1372 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 5 ms 1536 KB Output is correct
10 Correct 8 ms 1372 KB Output is correct
11 Correct 13 ms 1628 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Runtime error 353 ms 524288 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -