oj.uz

Submission #970959

# Submission time Handle Problem Language Result Execution time Memory
970959 2024-04-27T16:03:08 Z vladilius The short shank; Redemption (BOI21_prison) C++17
0 / 100
 292 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++){
        for (int j = 1; j <= n; j++){
            if (h[j][i] == h[j][i + 1]){
                f[i] = j - 1;
                break;
            }
        }
        if (!f[i]) f[i] = n + 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
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 4 ms 1116 KB Output is correct
4 Correct 8 ms 1372 KB Output is correct
5 Correct 14 ms 1704 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Incorrect 7 ms 1568 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 4 ms 1116 KB Output is correct
4 Correct 8 ms 1372 KB Output is correct
5 Correct 14 ms 1704 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Incorrect 7 ms 1568 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 186 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 0 ms 348 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 4 ms 1116 KB Output is correct
4 Correct 8 ms 1372 KB Output is correct
5 Correct 14 ms 1704 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Incorrect 7 ms 1568 KB Output isn't correct
8 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 3 ms 1116 KB Output is correct
3 Correct 4 ms 1116 KB Output is correct
4 Correct 8 ms 1372 KB Output is correct
5 Correct 14 ms 1704 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Incorrect 7 ms 1568 KB Output isn't correct
8 Halted 0 ms 0 KB -