oj.uz

Submission #868149

# Submission time Handle Problem Language Result Execution time Memory
868149 2023-10-30T13:45:50 Z HossamHero7 The short shank; Redemption (BOI21_prison) C++14
80 / 100
 2000 ms 184212 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
struct segtree{
    int n;
    vector<pair<int,int>> tree;
    vector<int> lazy;
    void build(int node,int l,int r){
        if(l == r) return tree[node] = {0,l-1} , void();
        int md = l + r >> 1;
        build(node<<1,l,md) , build(node<<1|1,md+1,r);
        tree[node] = max(tree[node<<1],tree[node<<1|1]);
    }
    segtree(int _n){
        n = _n;
        tree.resize(4*n+5);
        lazy.resize(4*n+5);
        build(1,1,n);
    }
    void prop(int node,int l,int r){
        tree[node].first += lazy[node];
        if(l != r){
            lazy[node<<1] += lazy[node];
            lazy[node<<1|1] += lazy[node];
        }
        lazy[node] = 0;
    }
    void update(int node,int l,int r,int lQ,int rQ,int val){
        if(l>r) return;
        if(lazy[node]) prop(node,l,r);
        if(lQ>r || l>rQ) return;
        if(lQ<=l&&r<=rQ){
            lazy[node] += val;
            prop(node,l,r);
            return;
        }
        int md = l + r >> 1;
        update(node<<1,l,md,lQ,rQ,val) , update(node<<1|1,md+1,r,lQ,rQ,val);
        tree[node] = max(tree[node<<1],tree[node<<1|1]);
    }
    void update(int l,int r,int val){
        update(1,1,n,l+1,r+1,val);
    }
    pair<int,int> getMaxPoint(){
        if(lazy[1]) prop(1,1,n);
        return tree[1];
    }
};
void solve(){
    int n,d,t;
    cin>>n>>d>>t;
    vector<int> a(n);
    for(auto &i:a) cin>>i;
    vector<int> lst(n);
    vector<int> sts;
    int ans = 0;
    vector<int> starts(n,-1);
    segtree sg(n);
    for(int i=0;i<n;i++){
        while(sts.size()){    
            int j = sts.back();
            int dur = t - a[j] + j;
            if(dur < i) sts.pop_back();
            else break;
        }
        if(a[i] <= t){
            ans ++;
            while(sts.size()){
                int j = sts.back();
                int dur1 = t - a[j] + j;
                int dur2 = t - a[i] + i;
                if(dur2 >= dur1) sts.pop_back();
                else break;
            }
            sts.push_back(i);
        }
        else {
            if(sts.size()){
                lst[i] = sts.back() , ans ++;
                sg.update(lst[i],i-1,1);
                starts[i-1] = lst[i];
            }
        }
    }
    set<int> ends;
    for(int i=0;i<n;i++){
        if(~starts[i]) ends.insert(i);
    }
    while(d--){
        auto [f,p] = sg.getMaxPoint();
        ans -= f;
        auto it = ends.lower_bound(p);
        while(it != ends.end()){
            int x = *it;
            int s = starts[x];
            if(s <= p) {
                sg.update(s,x,-1);
                starts[x] = -1;
            }
            if(~starts[x]) it ++;
            else {
                auto itt = it;
                itt ++;
                ends.erase(it);
                it = itt;
            }
        }
    }
    cout<<ans<<endl;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

prison.cpp: In member function 'void segtree::build(int, int, int)':
prison.cpp:11:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |         int md = l + r >> 1;
      |                  ~~^~~
prison.cpp: In member function 'void segtree::update(int, int, int, int, int, int)':
prison.cpp:38:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |         int md = l + r >> 1;
      |                  ~~^~~
prison.cpp: In function 'void solve()':
prison.cpp:91:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   91 |         auto [f,p] = sg.getMaxPoint();
      |              ^

Subtask #1
15.0 / 15.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 147 ms 46380 KB Output is correct
3 Correct 120 ms 42584 KB Output is correct
4 Correct 168 ms 45932 KB Output is correct
5 Correct 183 ms 46932 KB Output is correct
6 Correct 154 ms 43732 KB Output is correct
7 Correct 499 ms 57168 KB Output is correct
8 Correct 181 ms 46160 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 380 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 488 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 3 ms 600 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 2 ms 824 KB Output is correct
35 Correct 3 ms 604 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 25 ms 7556 KB Output is correct
3 Correct 22 ms 7156 KB Output is correct
4 Correct 42 ms 7636 KB Output is correct
5 Correct 55 ms 7916 KB Output is correct
6 Correct 47 ms 8020 KB Output is correct
7 Correct 22 ms 6736 KB Output is correct
8 Correct 20 ms 6492 KB Output is correct
9 Correct 73 ms 8784 KB Output is correct
10 Correct 17 ms 6924 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 380 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 488 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 3 ms 600 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 2 ms 824 KB Output is correct
35 Correct 3 ms 604 KB Output is correct
36 Correct 0 ms 600 KB Output is correct
37 Correct 25 ms 7556 KB Output is correct
38 Correct 22 ms 7156 KB Output is correct
39 Correct 42 ms 7636 KB Output is correct
40 Correct 55 ms 7916 KB Output is correct
41 Correct 47 ms 8020 KB Output is correct
42 Correct 22 ms 6736 KB Output is correct
43 Correct 20 ms 6492 KB Output is correct
44 Correct 73 ms 8784 KB Output is correct
45 Correct 17 ms 6924 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 604 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 2 ms 604 KB Output is correct
58 Correct 2 ms 604 KB Output is correct
59 Correct 4 ms 604 KB Output is correct
60 Correct 2 ms 604 KB Output is correct
61 Correct 3 ms 848 KB Output is correct
62 Correct 2 ms 600 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 2 ms 604 KB Output is correct
65 Correct 2 ms 604 KB Output is correct
66 Correct 2 ms 600 KB Output is correct
67 Correct 2 ms 604 KB Output is correct
68 Correct 2 ms 604 KB Output is correct
69 Correct 3 ms 604 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 25 ms 7632 KB Output is correct
72 Correct 22 ms 7260 KB Output is correct
73 Correct 41 ms 7768 KB Output is correct
74 Correct 47 ms 8020 KB Output is correct
75 Correct 48 ms 7912 KB Output is correct
76 Correct 21 ms 6748 KB Output is correct
77 Correct 24 ms 6680 KB Output is correct
78 Correct 66 ms 8788 KB Output is correct
79 Correct 17 ms 6736 KB Output is correct
80 Correct 340 ms 7248 KB Output is correct
81 Correct 718 ms 7772 KB Output is correct
82 Correct 683 ms 7360 KB Output is correct
83 Correct 81 ms 7760 KB Output is correct
84 Correct 349 ms 7504 KB Output is correct
85 Correct 57 ms 8272 KB Output is correct
86 Correct 417 ms 7424 KB Output is correct
87 Correct 321 ms 6488 KB Output is correct
88 Correct 54 ms 8268 KB Output is correct
89 Correct 50 ms 8788 KB Output is correct
90 Correct 38 ms 8236 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 380 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 488 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 147 ms 46380 KB Output is correct
14 Correct 120 ms 42584 KB Output is correct
15 Correct 168 ms 45932 KB Output is correct
16 Correct 183 ms 46932 KB Output is correct
17 Correct 154 ms 43732 KB Output is correct
18 Correct 499 ms 57168 KB Output is correct
19 Correct 181 ms 46160 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 2 ms 768 KB Output is correct
35 Correct 3 ms 600 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 2 ms 600 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 2 ms 824 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 0 ms 600 KB Output is correct
45 Correct 25 ms 7556 KB Output is correct
46 Correct 22 ms 7156 KB Output is correct
47 Correct 42 ms 7636 KB Output is correct
48 Correct 55 ms 7916 KB Output is correct
49 Correct 47 ms 8020 KB Output is correct
50 Correct 22 ms 6736 KB Output is correct
51 Correct 20 ms 6492 KB Output is correct
52 Correct 73 ms 8784 KB Output is correct
53 Correct 17 ms 6924 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 604 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 2 ms 604 KB Output is correct
66 Correct 2 ms 604 KB Output is correct
67 Correct 4 ms 604 KB Output is correct
68 Correct 2 ms 604 KB Output is correct
69 Correct 3 ms 848 KB Output is correct
70 Correct 2 ms 600 KB Output is correct
71 Correct 2 ms 604 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 2 ms 600 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 3 ms 604 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 25 ms 7632 KB Output is correct
80 Correct 22 ms 7260 KB Output is correct
81 Correct 41 ms 7768 KB Output is correct
82 Correct 47 ms 8020 KB Output is correct
83 Correct 48 ms 7912 KB Output is correct
84 Correct 21 ms 6748 KB Output is correct
85 Correct 24 ms 6680 KB Output is correct
86 Correct 66 ms 8788 KB Output is correct
87 Correct 17 ms 6736 KB Output is correct
88 Correct 340 ms 7248 KB Output is correct
89 Correct 718 ms 7772 KB Output is correct
90 Correct 683 ms 7360 KB Output is correct
91 Correct 81 ms 7760 KB Output is correct
92 Correct 349 ms 7504 KB Output is correct
93 Correct 57 ms 8272 KB Output is correct
94 Correct 417 ms 7424 KB Output is correct
95 Correct 321 ms 6488 KB Output is correct
96 Correct 54 ms 8268 KB Output is correct
97 Correct 50 ms 8788 KB Output is correct
98 Correct 38 ms 8236 KB Output is correct
99 Correct 0 ms 348 KB Output is correct
100 Correct 0 ms 348 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 0 ms 348 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 0 ms 348 KB Output is correct
108 Correct 1 ms 348 KB Output is correct
109 Correct 0 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 155 ms 46312 KB Output is correct
112 Correct 120 ms 42576 KB Output is correct
113 Correct 167 ms 45776 KB Output is correct
114 Correct 175 ms 46864 KB Output is correct
115 Correct 159 ms 43736 KB Output is correct
116 Correct 484 ms 57176 KB Output is correct
117 Correct 186 ms 46024 KB Output is correct
118 Correct 3 ms 604 KB Output is correct
119 Correct 2 ms 604 KB Output is correct
120 Correct 3 ms 604 KB Output is correct
121 Correct 3 ms 604 KB Output is correct
122 Correct 4 ms 600 KB Output is correct
123 Correct 2 ms 604 KB Output is correct
124 Correct 2 ms 724 KB Output is correct
125 Correct 2 ms 604 KB Output is correct
126 Correct 2 ms 604 KB Output is correct
127 Correct 1 ms 600 KB Output is correct
128 Correct 1 ms 604 KB Output is correct
129 Correct 2 ms 604 KB Output is correct
130 Correct 3 ms 728 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 27 ms 7656 KB Output is correct
133 Correct 31 ms 7140 KB Output is correct
134 Correct 48 ms 7644 KB Output is correct
135 Correct 49 ms 7920 KB Output is correct
136 Correct 48 ms 8032 KB Output is correct
137 Correct 21 ms 6748 KB Output is correct
138 Correct 21 ms 6504 KB Output is correct
139 Correct 70 ms 8648 KB Output is correct
140 Correct 18 ms 6744 KB Output is correct
141 Correct 379 ms 7356 KB Output is correct
142 Correct 709 ms 7780 KB Output is correct
143 Correct 673 ms 7356 KB Output is correct
144 Correct 113 ms 7764 KB Output is correct
145 Correct 350 ms 7300 KB Output is correct
146 Correct 60 ms 8440 KB Output is correct
147 Correct 412 ms 7424 KB Output is correct
148 Correct 328 ms 6716 KB Output is correct
149 Correct 57 ms 8016 KB Output is correct
150 Correct 67 ms 8796 KB Output is correct
151 Correct 38 ms 8016 KB Output is correct
152 Execution timed out 2016 ms 184212 KB Time limit exceeded
153 Halted 0 ms 0 KB -