oj.uz

Submission #971030

# Submission time Handle Problem Language Result Execution time Memory
971030 2024-04-27T20:40:47 Z vladilius The short shank; Redemption (BOI21_prison) C++17
15 / 100
 2000 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ld, int>;
#define f first
#define s second

bool operator < (pll x, pll y){
    if (x.f == y.f){
        return x.s < y.s;
    }
    if (x.f > y.f) return 1;
    return 0;
}

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++){
        int mx = 0, cnt = 0;
        for (int j = i; j <= n; j++){
            if (a[j] <= t){
                int m = t - a[j];
                mx = max(mx, j + m);
            }
            cnt += (j <= mx);
            h[i][j] = cnt;
        }
    }

    auto solve = [&](ld m){
        pll dp[n + 1];
        for (int i = 1; i <= n; i++){
            dp[i] = {h[1][i], 0};
            for (int j = 1; j < i; j++){
                // [1, j] | [j + 1, i]
                dp[i] = min(dp[i], {dp[j].f + h[j + 1][i] + m, dp[j].s + 1});
            }
        }

        return dp[n];
    };
    
    ld l = 0, r = n;
    int tt = 50;
    while (tt--){
        ld m = (l + r) / 2;
        auto [v, k] = solve(m);
        if (k > d){
            l = m;
        }
        else {
            r = m;
        }
    }
    
    auto [v, k] = solve(l);
    cout<<round(v - l * 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 23 ms 1140 KB Output is correct
3 Correct 23 ms 1116 KB Output is correct
4 Correct 37 ms 1372 KB Output is correct
5 Correct 37 ms 1368 KB Output is correct
6 Correct 36 ms 1368 KB Output is correct
7 Correct 41 ms 1372 KB Output is correct
8 Correct 34 ms 1368 KB Output is correct
9 Correct 34 ms 1372 KB Output is correct
10 Correct 34 ms 1372 KB Output is correct
11 Correct 33 ms 1368 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 360 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 23 ms 1140 KB Output is correct
3 Correct 23 ms 1116 KB Output is correct
4 Correct 37 ms 1372 KB Output is correct
5 Correct 37 ms 1368 KB Output is correct
6 Correct 36 ms 1368 KB Output is correct
7 Correct 41 ms 1372 KB Output is correct
8 Correct 34 ms 1368 KB Output is correct
9 Correct 34 ms 1372 KB Output is correct
10 Correct 34 ms 1372 KB Output is correct
11 Correct 33 ms 1368 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 23 ms 1116 KB Output is correct
14 Correct 23 ms 1148 KB Output is correct
15 Correct 37 ms 1472 KB Output is correct
16 Correct 39 ms 1620 KB Output is correct
17 Correct 32 ms 1372 KB Output is correct
18 Correct 34 ms 1368 KB Output is correct
19 Correct 34 ms 1372 KB Output is correct
20 Correct 34 ms 1472 KB Output is correct
21 Correct 34 ms 1372 KB Output is correct
22 Correct 33 ms 1624 KB Output is correct
23 Execution timed out 2071 ms 63324 KB Time limit exceeded
24 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 206 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 23 ms 1140 KB Output is correct
3 Correct 23 ms 1116 KB Output is correct
4 Correct 37 ms 1372 KB Output is correct
5 Correct 37 ms 1368 KB Output is correct
6 Correct 36 ms 1368 KB Output is correct
7 Correct 41 ms 1372 KB Output is correct
8 Correct 34 ms 1368 KB Output is correct
9 Correct 34 ms 1372 KB Output is correct
10 Correct 34 ms 1372 KB Output is correct
11 Correct 33 ms 1368 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 23 ms 1116 KB Output is correct
14 Correct 23 ms 1148 KB Output is correct
15 Correct 37 ms 1472 KB Output is correct
16 Correct 39 ms 1620 KB Output is correct
17 Correct 32 ms 1372 KB Output is correct
18 Correct 34 ms 1368 KB Output is correct
19 Correct 34 ms 1372 KB Output is correct
20 Correct 34 ms 1472 KB Output is correct
21 Correct 34 ms 1372 KB Output is correct
22 Correct 33 ms 1624 KB Output is correct
23 Execution timed out 2071 ms 63324 KB Time limit exceeded
24 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 23 ms 1140 KB Output is correct
3 Correct 23 ms 1116 KB Output is correct
4 Correct 37 ms 1372 KB Output is correct
5 Correct 37 ms 1368 KB Output is correct
6 Correct 36 ms 1368 KB Output is correct
7 Correct 41 ms 1372 KB Output is correct
8 Correct 34 ms 1368 KB Output is correct
9 Correct 34 ms 1372 KB Output is correct
10 Correct 34 ms 1372 KB Output is correct
11 Correct 33 ms 1368 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Runtime error 360 ms 524288 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -