oj.uz

Submission #890688

# Submission time Handle Problem Language Result Execution time Memory
890688 2023-12-21T18:28:40 Z NotLinux Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 970 ms 262144 KB 
#pragma Ospace
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int M = 4e6 + 7;
const int inf = 2e9 + 7;
// bool debug_mode = 0;
struct MergeSortTree{
    vector < int > tree[M];
    void build(vector < int > &v , int ind=1 , int l=1 , int r=N){
        for(int i = l-1;i<r;i++){
            tree[ind].push_back(v[i]);
        }
        sort(tree[ind].begin() , tree[ind].end());
        if(l != r){
            int mid = (l+r) >> 1;
            build(v , ind*2 , l , mid);
            build(v , ind*2+1 , mid+1 , r);
        }
    }
    inline int query(int ind , int val){
        auto it = lower_bound(tree[ind].begin() , tree[ind].end() , val);
        int res = -1;
        if(it != tree[ind].begin()){
            res = *(--it);
        }
        // if(debug_mode){
        //     cout << "v : ";for(auto itr : tree[ind])cout << itr << " ";cout << endl;
        //     cout << "val : " << val << endl;
        //     cout << "res : " << res << endl;
        // }
        return res;
    }
} mst;
struct SegmentTree{
    struct Node{
        int mx=0 , indx=0 , ans=-inf;
    } tree[M];
    Node merge(Node &a , Node &b){
        Node c;
        c.mx = max(a.mx , b.mx);
        int tmp = mst.query(b.indx , a.mx);
        if(tmp != -1){
            c.ans = max({a.ans , b.ans , (int)a.mx + (int)tmp});
        }
        else {
            c.ans = max(a.ans , b.ans);
        }
        return c;
    }
    void build(vector < int > &v , int ind=1 , int l=1 , int r=N){
        for(int i = l-1;i<r;i++){
            tree[ind].mx = max(tree[ind].mx , v[i]);
        }
        if(l != r){
            int mid = (l+r) >> 1;
            build(v , ind*2 , l , mid);
            build(v , ind*2+1 , mid+1 , r);
            tree[ind] = merge(tree[ind*2] , tree[ind*2+1]);
        }
        tree[ind].indx = ind;
        // cout << l << " " << r << " => " << tree[ind].mx << " " << tree[ind].ans << endl;
    }
    vector < Node > vec;
    void dfs(int ql , int qr , int ind=1 , int l=1 , int r=N){
        if(l >= ql and r <= qr){
            // cout << l << " " << r << " : " << tree[ind].mx << " " << tree[ind].ans << endl;
            vec.push_back(tree[ind]);
        }
        else if(l > qr or r < ql){
            return;
        }
        else{
            int mid = (l+r) >> 1;
            dfs(ql , qr , ind*2 , l , mid);
            dfs(ql , qr , ind*2+1 , mid+1 , r);
        }
    }
    int query(int l , int r){
        Node ret;
        // debug_mode = 1;
        for(auto itr : vec){
            ret = merge(ret , itr);
            // cout << ret.mx << " " << ret.ans << endl;
        }
        // debug_mode = 0;
        vec.clear();
        // cout << "query : " << ret.ans << endl;
        return ret.ans;
    }
} segt;
void solve(){
    int n,m;
    cin >> n >> m;
    vector < int > arr(n);
    for(int i = 0;i<n;i++){
        cin >> arr[i];
    }
    mst.build(arr,1,1,arr.size());
    segt.build(arr,1,1,arr.size());
    // cout << "---" << endl;
    for(int qt = 0;qt<m;qt++){
        int l,r,k;
        cin >> l >> r >> k;
        segt.dfs(l,r,1,1,arr.size());
        cout << (segt.query(l,r) <= k) << '\n';
        // cout << "---" << endl;
    }
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int testcase = 1;//cin >> testcase;
    while(testcase--)solve();
}

Compilation message

sortbooks.cpp:1: warning: ignoring '#pragma Ospace ' [-Wunknown-pragmas]
    1 | #pragma Ospace
      |

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 141140 KB Output is correct
2 Correct 29 ms 141104 KB Output is correct
3 Correct 30 ms 141148 KB Output is correct
4 Correct 30 ms 141312 KB Output is correct
5 Correct 30 ms 141284 KB Output is correct
6 Correct 30 ms 141368 KB Output is correct
7 Correct 30 ms 141404 KB Output is correct
8 Correct 30 ms 141400 KB Output is correct
9 Correct 30 ms 141388 KB Output is correct
10 Correct 30 ms 141404 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 141140 KB Output is correct
2 Correct 29 ms 141104 KB Output is correct
3 Correct 30 ms 141148 KB Output is correct
4 Correct 30 ms 141312 KB Output is correct
5 Correct 30 ms 141284 KB Output is correct
6 Correct 30 ms 141368 KB Output is correct
7 Correct 30 ms 141404 KB Output is correct
8 Correct 30 ms 141400 KB Output is correct
9 Correct 30 ms 141388 KB Output is correct
10 Correct 30 ms 141404 KB Output is correct
11 Correct 32 ms 141400 KB Output is correct
12 Correct 40 ms 141916 KB Output is correct
13 Correct 40 ms 141908 KB Output is correct
14 Correct 37 ms 141908 KB Output is correct
15 Correct 36 ms 141904 KB Output is correct
16 Correct 34 ms 141884 KB Output is correct
17 Correct 32 ms 141652 KB Output is correct
18 Correct 33 ms 141820 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 970 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 156348 KB Output is correct
2 Correct 203 ms 156364 KB Output is correct
3 Correct 165 ms 156496 KB Output is correct
4 Correct 163 ms 156372 KB Output is correct
5 Correct 170 ms 156740 KB Output is correct
6 Correct 142 ms 156368 KB Output is correct
7 Correct 143 ms 156316 KB Output is correct
8 Correct 150 ms 156608 KB Output is correct
9 Correct 60 ms 142420 KB Output is correct
10 Correct 145 ms 156228 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 141140 KB Output is correct
2 Correct 29 ms 141104 KB Output is correct
3 Correct 30 ms 141148 KB Output is correct
4 Correct 30 ms 141312 KB Output is correct
5 Correct 30 ms 141284 KB Output is correct
6 Correct 30 ms 141368 KB Output is correct
7 Correct 30 ms 141404 KB Output is correct
8 Correct 30 ms 141400 KB Output is correct
9 Correct 30 ms 141388 KB Output is correct
10 Correct 30 ms 141404 KB Output is correct
11 Correct 32 ms 141400 KB Output is correct
12 Correct 40 ms 141916 KB Output is correct
13 Correct 40 ms 141908 KB Output is correct
14 Correct 37 ms 141908 KB Output is correct
15 Correct 36 ms 141904 KB Output is correct
16 Correct 34 ms 141884 KB Output is correct
17 Correct 32 ms 141652 KB Output is correct
18 Correct 33 ms 141820 KB Output is correct
19 Correct 532 ms 173748 KB Output is correct
20 Correct 535 ms 173556 KB Output is correct
21 Correct 424 ms 173400 KB Output is correct
22 Correct 427 ms 173336 KB Output is correct
23 Correct 437 ms 173488 KB Output is correct
24 Correct 298 ms 173596 KB Output is correct
25 Correct 305 ms 173576 KB Output is correct
26 Correct 376 ms 173520 KB Output is correct
27 Correct 366 ms 173444 KB Output is correct
28 Correct 379 ms 173340 KB Output is correct
29 Correct 400 ms 173536 KB Output is correct
30 Correct 388 ms 173540 KB Output is correct
31 Correct 397 ms 173516 KB Output is correct
32 Correct 426 ms 173924 KB Output is correct
33 Correct 396 ms 173508 KB Output is correct
34 Correct 290 ms 173496 KB Output is correct
35 Correct 289 ms 173264 KB Output is correct
36 Correct 291 ms 174048 KB Output is correct
37 Correct 289 ms 173320 KB Output is correct
38 Correct 288 ms 173456 KB Output is correct
39 Correct 370 ms 172496 KB Output is correct
40 Correct 230 ms 160312 KB Output is correct
41 Correct 311 ms 172528 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 141140 KB Output is correct
2 Correct 29 ms 141104 KB Output is correct
3 Correct 30 ms 141148 KB Output is correct
4 Correct 30 ms 141312 KB Output is correct
5 Correct 30 ms 141284 KB Output is correct
6 Correct 30 ms 141368 KB Output is correct
7 Correct 30 ms 141404 KB Output is correct
8 Correct 30 ms 141400 KB Output is correct
9 Correct 30 ms 141388 KB Output is correct
10 Correct 30 ms 141404 KB Output is correct
11 Correct 32 ms 141400 KB Output is correct
12 Correct 40 ms 141916 KB Output is correct
13 Correct 40 ms 141908 KB Output is correct
14 Correct 37 ms 141908 KB Output is correct
15 Correct 36 ms 141904 KB Output is correct
16 Correct 34 ms 141884 KB Output is correct
17 Correct 32 ms 141652 KB Output is correct
18 Correct 33 ms 141820 KB Output is correct
19 Runtime error 970 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -