oj.uz

Submission #408786

# Submission time Handle Problem Language Result Execution time Memory
408786 2021-05-19T15:55:54 Z rocks03 The short shank; Redemption (BOI21_prison) C++14
70 / 100
 2000 ms 152212 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 2e6+100;
int N, D, T, a[MAXN];

vector<int> g[MAXN];
void compute_time(){
    stack<int> st;
    rep(i, 0, N - 1){
        while(!st.empty()){
            int j = st.top();
            if(a[j] + i - j > T) st.pop();
            else break;
        }
        if(a[i] <= T){
            g[i].pb(i);
        } else{
            if(!st.empty()) g[st.top()].pb(i);
        }
        st.push(i);
    }
}

struct Node{
    pll dp = {0, 0}; int lazy = 0;
};
class SegmentTree{
public:
    vector<Node> st;
    void build(int n){
        st = vector<Node>(4 * n);
    }
    void push(int i){
        if(st[i].lazy){
            int cl = 2 * i + 1, cr = 2 * i + 2;
            st[cl].dp.ff += st[i].lazy, st[cl].lazy += st[i].lazy;
            st[cr].dp.ff += st[i].lazy, st[cr].lazy += st[i].lazy;
            st[i].lazy = 0;
        }
    }
    void merge(int i){
        int cl = 2 * i + 1, cr = 2 * i + 2;
        if(st[cl].dp < st[cr].dp){
            st[i].dp = st[cl].dp;
        } else{
            st[i].dp = st[cr].dp;
        }
    }
    void add(int i, int l, int r, int ql, int qr, int k){
        if(ql <= l && r <= qr){
            st[i].dp.ff += k, st[i].lazy += k; return;
        }
        if(qr < l || ql > r) return;
        push(i);
        int m = (l + r) / 2;
        add(2 * i + 1, l, m, ql, qr, k);
        add(2 * i + 2, m + 1, r, ql, qr, k);
        merge(i);
    }
    void set(int i, int l, int r, int p, pll val){
        if(l == r){
            st[i].dp = val; st[i].lazy = 0; return;
        } else{
            push(i);
            int m = (l + r) / 2;
            if(p <= m) set(2 * i + 1, l, m, p, val);
            else set(2 * i + 2, m + 1, r, p, val);
            merge(i);
        }
    }
    pll query(int i, int l, int r, int ql, int qr){
        if(ql <= l && r <= qr){
            return st[i].dp;
        }
        if(qr < l || ql > r) return {LLONG_MAX, 0};
        push(i);
        int m = (l + r) / 2;
        pll ans1 = query(2 * i + 1, l, m, ql, qr);
        pll ans2 = query(2 * i + 2, m + 1, r, ql, qr);
        if(ans1 < ans2) return ans1;
        else return ans2;
    }
} st;

pll compute_dp(ll penalty){
    st.build(N + 1);
    pll ans;
    per(i, N - 1, 0){
        for(int j : g[i]){
            st.add(0, 0, N, j + 1, N, +1);
        }
        pll val = st.query(0, 0, N, i + 1, N);
        val.ff += penalty, val.ss += 1;
        pll val2 = st.query(0, 0, N, N, N);
        if(val > val2) val = val2;
        st.set(0, 0, N, i, val);
        if(i == 0) ans = val;
    }
    return ans;
}

void solve(){
    cin >> N >> D >> T;
    rep(i, 0, N - 1) cin >> a[i];
    compute_time();
    int l = -1, r = N + 1;
    while(r - l > 1){
        int m = (l + r) / 2;
        pll ans = compute_dp(m);
        if(ans.ss <= D) r = m;
        else l = m;
    }
    pll ans = compute_dp(r);
    cout << ans.ff - D * r;
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47256 KB Output is correct
2 Correct 28 ms 47284 KB Output is correct
3 Correct 28 ms 47384 KB Output is correct
4 Correct 30 ms 47320 KB Output is correct
5 Correct 32 ms 47404 KB Output is correct
6 Correct 28 ms 47252 KB Output is correct
7 Correct 33 ms 47348 KB Output is correct
8 Correct 28 ms 47400 KB Output is correct
9 Correct 32 ms 47400 KB Output is correct
10 Correct 29 ms 47404 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47304 KB Output is correct
2 Execution timed out 2088 ms 152212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47256 KB Output is correct
2 Correct 28 ms 47284 KB Output is correct
3 Correct 28 ms 47384 KB Output is correct
4 Correct 30 ms 47320 KB Output is correct
5 Correct 32 ms 47404 KB Output is correct
6 Correct 28 ms 47252 KB Output is correct
7 Correct 33 ms 47348 KB Output is correct
8 Correct 28 ms 47400 KB Output is correct
9 Correct 32 ms 47400 KB Output is correct
10 Correct 29 ms 47404 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct
12 Correct 26 ms 47256 KB Output is correct
13 Correct 28 ms 47316 KB Output is correct
14 Correct 28 ms 47332 KB Output is correct
15 Correct 29 ms 47408 KB Output is correct
16 Correct 29 ms 47356 KB Output is correct
17 Correct 29 ms 47396 KB Output is correct
18 Correct 29 ms 47304 KB Output is correct
19 Correct 28 ms 47368 KB Output is correct
20 Correct 30 ms 47352 KB Output is correct
21 Correct 29 ms 47368 KB Output is correct
22 Correct 31 ms 47328 KB Output is correct
23 Correct 62 ms 48096 KB Output is correct
24 Correct 60 ms 48044 KB Output is correct
25 Correct 62 ms 48132 KB Output is correct
26 Correct 60 ms 48076 KB Output is correct
27 Correct 68 ms 48096 KB Output is correct
28 Correct 60 ms 48100 KB Output is correct
29 Correct 61 ms 48128 KB Output is correct
30 Correct 57 ms 48088 KB Output is correct
31 Correct 56 ms 48080 KB Output is correct
32 Correct 57 ms 48104 KB Output is correct
33 Correct 58 ms 48124 KB Output is correct
34 Correct 62 ms 48092 KB Output is correct
35 Correct 69 ms 48108 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47180 KB Output is correct
2 Correct 1312 ms 62768 KB Output is correct
3 Correct 1269 ms 63784 KB Output is correct
4 Correct 1201 ms 62920 KB Output is correct
5 Correct 1184 ms 63532 KB Output is correct
6 Correct 1200 ms 63400 KB Output is correct
7 Correct 1131 ms 62776 KB Output is correct
8 Correct 1097 ms 62716 KB Output is correct
9 Correct 1160 ms 62532 KB Output is correct
10 Correct 1185 ms 63232 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47256 KB Output is correct
2 Correct 28 ms 47284 KB Output is correct
3 Correct 28 ms 47384 KB Output is correct
4 Correct 30 ms 47320 KB Output is correct
5 Correct 32 ms 47404 KB Output is correct
6 Correct 28 ms 47252 KB Output is correct
7 Correct 33 ms 47348 KB Output is correct
8 Correct 28 ms 47400 KB Output is correct
9 Correct 32 ms 47400 KB Output is correct
10 Correct 29 ms 47404 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct
12 Correct 26 ms 47256 KB Output is correct
13 Correct 28 ms 47316 KB Output is correct
14 Correct 28 ms 47332 KB Output is correct
15 Correct 29 ms 47408 KB Output is correct
16 Correct 29 ms 47356 KB Output is correct
17 Correct 29 ms 47396 KB Output is correct
18 Correct 29 ms 47304 KB Output is correct
19 Correct 28 ms 47368 KB Output is correct
20 Correct 30 ms 47352 KB Output is correct
21 Correct 29 ms 47368 KB Output is correct
22 Correct 31 ms 47328 KB Output is correct
23 Correct 62 ms 48096 KB Output is correct
24 Correct 60 ms 48044 KB Output is correct
25 Correct 62 ms 48132 KB Output is correct
26 Correct 60 ms 48076 KB Output is correct
27 Correct 68 ms 48096 KB Output is correct
28 Correct 60 ms 48100 KB Output is correct
29 Correct 61 ms 48128 KB Output is correct
30 Correct 57 ms 48088 KB Output is correct
31 Correct 56 ms 48080 KB Output is correct
32 Correct 57 ms 48104 KB Output is correct
33 Correct 58 ms 48124 KB Output is correct
34 Correct 62 ms 48092 KB Output is correct
35 Correct 69 ms 48108 KB Output is correct
36 Correct 26 ms 47180 KB Output is correct
37 Correct 1312 ms 62768 KB Output is correct
38 Correct 1269 ms 63784 KB Output is correct
39 Correct 1201 ms 62920 KB Output is correct
40 Correct 1184 ms 63532 KB Output is correct
41 Correct 1200 ms 63400 KB Output is correct
42 Correct 1131 ms 62776 KB Output is correct
43 Correct 1097 ms 62716 KB Output is correct
44 Correct 1160 ms 62532 KB Output is correct
45 Correct 1185 ms 63232 KB Output is correct
46 Correct 26 ms 47188 KB Output is correct
47 Correct 29 ms 47312 KB Output is correct
48 Correct 39 ms 47312 KB Output is correct
49 Correct 30 ms 47304 KB Output is correct
50 Correct 30 ms 47288 KB Output is correct
51 Correct 29 ms 47300 KB Output is correct
52 Correct 29 ms 47372 KB Output is correct
53 Correct 29 ms 47400 KB Output is correct
54 Correct 29 ms 47388 KB Output is correct
55 Correct 30 ms 47408 KB Output is correct
56 Correct 30 ms 47308 KB Output is correct
57 Correct 61 ms 48140 KB Output is correct
58 Correct 61 ms 48084 KB Output is correct
59 Correct 61 ms 48092 KB Output is correct
60 Correct 61 ms 48060 KB Output is correct
61 Correct 61 ms 48136 KB Output is correct
62 Correct 60 ms 48144 KB Output is correct
63 Correct 60 ms 48160 KB Output is correct
64 Correct 58 ms 48116 KB Output is correct
65 Correct 57 ms 48016 KB Output is correct
66 Correct 59 ms 48128 KB Output is correct
67 Correct 58 ms 48116 KB Output is correct
68 Correct 61 ms 48032 KB Output is correct
69 Correct 60 ms 48032 KB Output is correct
70 Correct 26 ms 47180 KB Output is correct
71 Correct 1320 ms 63492 KB Output is correct
72 Correct 1246 ms 63888 KB Output is correct
73 Correct 1204 ms 62920 KB Output is correct
74 Correct 1187 ms 63428 KB Output is correct
75 Correct 1189 ms 63472 KB Output is correct
76 Correct 1114 ms 62748 KB Output is correct
77 Correct 1153 ms 62608 KB Output is correct
78 Correct 1182 ms 62612 KB Output is correct
79 Correct 1197 ms 63232 KB Output is correct
80 Correct 1258 ms 63768 KB Output is correct
81 Correct 1229 ms 63532 KB Output is correct
82 Correct 1232 ms 63776 KB Output is correct
83 Correct 1215 ms 62988 KB Output is correct
84 Correct 1206 ms 62728 KB Output is correct
85 Correct 1203 ms 63220 KB Output is correct
86 Correct 1145 ms 62936 KB Output is correct
87 Correct 1063 ms 62760 KB Output is correct
88 Correct 1098 ms 62552 KB Output is correct
89 Correct 1158 ms 62532 KB Output is correct
90 Correct 1171 ms 62796 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47256 KB Output is correct
2 Correct 28 ms 47284 KB Output is correct
3 Correct 28 ms 47384 KB Output is correct
4 Correct 30 ms 47320 KB Output is correct
5 Correct 32 ms 47404 KB Output is correct
6 Correct 28 ms 47252 KB Output is correct
7 Correct 33 ms 47348 KB Output is correct
8 Correct 28 ms 47400 KB Output is correct
9 Correct 32 ms 47400 KB Output is correct
10 Correct 29 ms 47404 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct
12 Correct 26 ms 47304 KB Output is correct
13 Execution timed out 2088 ms 152212 KB Time limit exceeded
14 Halted 0 ms 0 KB -