oj.uz

Submission #168503

# Submission time Handle Problem Language Result Execution time Memory
168503 2019-12-13T11:36:17 Z IldarKA Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 69636 KB 
#include <bits/stdc++.h>

using namespace std;
bool ans[1000001];
int n, m, a[1000001], t[4000001];
vector < int > inv[1000001];
stack < int > s;
vector < pair < pair < int, int >, pair < int, int > > >  q;
void upd(int v, int tl, int tr, int pos, int val){
    if(tl == tr){
        t[v] = max(t[v], val);
        return;
    }
    int mid = (tl + tr) / 2;
    if(mid >= pos){
        upd(v + v, tl, mid, pos, val);
    }
    else{
        upd(v + 1 + v, mid + 1, tr, pos, val);
    }
    t[v] = max(t[v + v], t[v + 1 + v]);
}
int get(int v, int tl, int tr, int l, int r){
    if(l > r){
        return 0;
    }
    if(l == tl && tr == r){
        return t[v];
    }
    int mid = (tl + tr) / 2;
    return max(get(v + v, tl, mid, l, min(r, mid)), get(v + 1 + v, mid + 1, tr, max(l, mid + 1), r));
}
int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = n; i >= 1; i--){
        while(!s.empty() && a[s.top()] < a[i]){
            inv[i].push_back(s.top());
            s.pop();
        }
        s.push(i);
    }
    for(int i = 1; i <= m; i++){
        int l, r, k;
        cin >> l >> r >> k;
        q.push_back({{l, r}, {k, i}});
    }
    sort(q.begin(), q.end());
    reverse(q.begin(), q.end());
    int l = n;
    for(int i = 0; i < m; i++){
        while(q[i].first.first <= l){
            for(auto to : inv[l]){
                upd(1, 1, n, to, a[to] + a[l]);
            }
            l--;
        }
        ans[q[i].second.second] = (get(1, 1, n, 1, q[i].first.second) <= q[i].second.first);
    }
    for(int i = 1; i <= m; i++){
        cout << ans[i] << '\n';
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 25 ms 23828 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23860 KB Output is correct
6 Correct 24 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 24 ms 23800 KB Output is correct
9 Correct 30 ms 23844 KB Output is correct
10 Correct 27 ms 23800 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 25 ms 23828 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23860 KB Output is correct
6 Correct 24 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 24 ms 23800 KB Output is correct
9 Correct 30 ms 23844 KB Output is correct
10 Correct 27 ms 23800 KB Output is correct
11 Correct 31 ms 24056 KB Output is correct
12 Correct 32 ms 24184 KB Output is correct
13 Correct 39 ms 24224 KB Output is correct
14 Correct 38 ms 24360 KB Output is correct
15 Correct 38 ms 24312 KB Output is correct
16 Correct 34 ms 24184 KB Output is correct
17 Correct 33 ms 24184 KB Output is correct
18 Correct 33 ms 24184 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3094 ms 69636 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 29564 KB Output is correct
2 Correct 261 ms 29628 KB Output is correct
3 Correct 240 ms 27500 KB Output is correct
4 Correct 245 ms 27572 KB Output is correct
5 Correct 242 ms 27424 KB Output is correct
6 Correct 232 ms 27444 KB Output is correct
7 Correct 233 ms 27600 KB Output is correct
8 Correct 230 ms 28296 KB Output is correct
9 Correct 178 ms 26732 KB Output is correct
10 Correct 226 ms 28208 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 25 ms 23828 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23860 KB Output is correct
6 Correct 24 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 24 ms 23800 KB Output is correct
9 Correct 30 ms 23844 KB Output is correct
10 Correct 27 ms 23800 KB Output is correct
11 Correct 31 ms 24056 KB Output is correct
12 Correct 32 ms 24184 KB Output is correct
13 Correct 39 ms 24224 KB Output is correct
14 Correct 38 ms 24360 KB Output is correct
15 Correct 38 ms 24312 KB Output is correct
16 Correct 34 ms 24184 KB Output is correct
17 Correct 33 ms 24184 KB Output is correct
18 Correct 33 ms 24184 KB Output is correct
19 Correct 675 ms 35908 KB Output is correct
20 Correct 677 ms 35832 KB Output is correct
21 Correct 663 ms 35876 KB Output is correct
22 Correct 705 ms 35764 KB Output is correct
23 Correct 662 ms 35608 KB Output is correct
24 Correct 603 ms 30152 KB Output is correct
25 Correct 606 ms 29800 KB Output is correct
26 Correct 618 ms 29752 KB Output is correct
27 Correct 616 ms 29832 KB Output is correct
28 Correct 622 ms 29748 KB Output is correct
29 Correct 622 ms 29708 KB Output is correct
30 Correct 624 ms 29724 KB Output is correct
31 Correct 636 ms 29772 KB Output is correct
32 Correct 629 ms 29668 KB Output is correct
33 Correct 624 ms 29688 KB Output is correct
34 Correct 598 ms 29664 KB Output is correct
35 Correct 589 ms 29668 KB Output is correct
36 Correct 590 ms 29784 KB Output is correct
37 Correct 588 ms 29832 KB Output is correct
38 Correct 598 ms 29644 KB Output is correct
39 Correct 551 ms 31068 KB Output is correct
40 Correct 468 ms 29168 KB Output is correct
41 Correct 526 ms 30520 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 25 ms 23828 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23860 KB Output is correct
6 Correct 24 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 24 ms 23800 KB Output is correct
9 Correct 30 ms 23844 KB Output is correct
10 Correct 27 ms 23800 KB Output is correct
11 Correct 31 ms 24056 KB Output is correct
12 Correct 32 ms 24184 KB Output is correct
13 Correct 39 ms 24224 KB Output is correct
14 Correct 38 ms 24360 KB Output is correct
15 Correct 38 ms 24312 KB Output is correct
16 Correct 34 ms 24184 KB Output is correct
17 Correct 33 ms 24184 KB Output is correct
18 Correct 33 ms 24184 KB Output is correct
19 Execution timed out 3094 ms 69636 KB Time limit exceeded
20 Halted 0 ms 0 KB -