oj.uz

Submission #971055

# Submission time Handle Problem Language Result Execution time Memory
971055 2024-04-27T21:33:24 Z vladilius The short shank; Redemption (BOI21_prison) C++17
35 / 100
 2000 ms 116088 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using pll = pair<ld, int>;
using pii = pair<int, int>;
#define f first
#define s second
const int inf = 1e9;
 
struct ST{
    vector<ld> t, p;
    vector<int> k;
    int n;
    
    void build(int v, int tl, int tr){
        if (tl == tr){
            k[v] = tl;
            return;
        }
        int tm = (tl + tr) / 2, vv = 2 * v;
        build(vv, tl, tm);
        build(vv + 1, tm + 1, tr);
        t[v] = tl;
    }
    
    ST(int ns){
        n = ns;
        t.resize(4 * n);
        p.resize(4 * n);
        k.resize(4 * n);
        build(1, 1, 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, ld& 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);
        if (t[vv] > t[vv + 1]){
            t[v] = t[vv + 1];
            k[v] = k[vv + 1];
        }
        else {
            t[v] = t[vv];
            k[v] = k[vv];
        }
        t[v] = min(t[vv], t[vv + 1]);
    }
    void add(int l, int r, ld x){
        if (l > r) return;
        add(1, 1, n, l, r, x);
    }
    pll get(int v, int tl, int tr, int& l, int& r){
        if (l > tr || r < tl) return {inf, 0};
        if (l <= tl && tr <= r){
            return {t[v], k[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));
    }
    pll get(int l, int r){
        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);
    int mx = 0, cnt = 0;
    for (int j = 1; j <= n; j++){
        if (a[j] <= t){
            int m = t - a[j];
            mx = max(mx, j + m);
        }
        cnt += (j <= mx);
        h[j] = cnt;
    }
    
    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;
    }
    
    auto solve = [&](ld m){
        pll dp[n + 1];
        ST T(n);
        for (int i = 1; i <= n; i++){
            dp[i] = {h[i], 0};
            T.add(1, f[i - 1] - 1, 1);
            auto [v, j] = T.get(1, i - 1);
            dp[i] = min(dp[i], {v + m, dp[j].s + 1});
            T.add(i, i, dp[i].f);
        }
        return dp[n];
    };
    
    ld lb = 0, rb = n;
    int tt = 30;
    while (tt--){
        ld m = (lb + rb) / 2;
        auto [v, k] = solve(m);
        if (k > d){
            lb = m;
        }
        else {
            rb = m;
        }
    }
    
    auto [v, k] = solve(lb);
    cout<<round(v - lb * d)<<"\n";
}

Subtask #1
15.0 / 15.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2086 ms 116088 KB Time limit exceeded
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 4 ms 348 KB Output is correct
3 Correct 4 ms 524 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 532 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 5 ms 536 KB Output is correct
19 Correct 5 ms 540 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 5 ms 348 KB Output is correct
23 Correct 51 ms 1252 KB Output is correct
24 Correct 50 ms 1248 KB Output is correct
25 Correct 50 ms 1248 KB Output is correct
26 Correct 50 ms 1248 KB Output is correct
27 Correct 50 ms 1252 KB Output is correct
28 Correct 51 ms 1252 KB Output is correct
29 Correct 50 ms 1220 KB Output is correct
30 Correct 50 ms 1332 KB Output is correct
31 Correct 45 ms 1252 KB Output is correct
32 Correct 47 ms 1248 KB Output is correct
33 Correct 47 ms 1252 KB Output is correct
34 Correct 51 ms 1252 KB Output is correct
35 Correct 50 ms 1252 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1191 ms 16748 KB Output is correct
3 Correct 1213 ms 16608 KB Output is correct
4 Correct 1149 ms 16648 KB Output is correct
5 Correct 1163 ms 16820 KB Output is correct
6 Correct 1132 ms 16800 KB Output is correct
7 Correct 1006 ms 16608 KB Output is correct
8 Correct 1014 ms 16660 KB Output is correct
9 Correct 1110 ms 16932 KB Output is correct
10 Incorrect 1099 ms 17032 KB Output isn't correct
11 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 4 ms 348 KB Output is correct
3 Correct 4 ms 524 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 532 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 5 ms 536 KB Output is correct
19 Correct 5 ms 540 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 5 ms 348 KB Output is correct
23 Correct 51 ms 1252 KB Output is correct
24 Correct 50 ms 1248 KB Output is correct
25 Correct 50 ms 1248 KB Output is correct
26 Correct 50 ms 1248 KB Output is correct
27 Correct 50 ms 1252 KB Output is correct
28 Correct 51 ms 1252 KB Output is correct
29 Correct 50 ms 1220 KB Output is correct
30 Correct 50 ms 1332 KB Output is correct
31 Correct 45 ms 1252 KB Output is correct
32 Correct 47 ms 1248 KB Output is correct
33 Correct 47 ms 1252 KB Output is correct
34 Correct 51 ms 1252 KB Output is correct
35 Correct 50 ms 1252 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1191 ms 16748 KB Output is correct
38 Correct 1213 ms 16608 KB Output is correct
39 Correct 1149 ms 16648 KB Output is correct
40 Correct 1163 ms 16820 KB Output is correct
41 Correct 1132 ms 16800 KB Output is correct
42 Correct 1006 ms 16608 KB Output is correct
43 Correct 1014 ms 16660 KB Output is correct
44 Correct 1110 ms 16932 KB Output is correct
45 Incorrect 1099 ms 17032 KB Output isn't correct
46 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 4 ms 348 KB Output is correct
3 Correct 4 ms 524 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Execution timed out 2086 ms 116088 KB Time limit exceeded
14 Halted 0 ms 0 KB -