oj.uz

Submission #890679

# Submission time Handle Problem Language Result Execution time Memory
890679 2023-12-21T18:24:08 Z NotLinux Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 974 ms 262144 KB 
#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 , indx;
        int ans;
        Node():mx(0) , ans(-inf) , indx(0){}
    } 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: In constructor 'SegmentTree::Node::Node()':
sortbooks.cpp:37:13: warning: 'SegmentTree::Node::ans' will be initialized after [-Wreorder]
   37 |         int ans;
      |             ^~~
sortbooks.cpp:36:18: warning:   'int SegmentTree::Node::indx' [-Wreorder]
   36 |         int mx , indx;
      |                  ^~~~
sortbooks.cpp:38:9: warning:   when initialized here [-Wreorder]
   38 |         Node():mx(0) , ans(-inf) , indx(0){}
      |         ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 141148 KB Output is correct
2 Correct 28 ms 141400 KB Output is correct
3 Correct 30 ms 141148 KB Output is correct
4 Correct 32 ms 141148 KB Output is correct
5 Correct 29 ms 141148 KB Output is correct
6 Correct 29 ms 141148 KB Output is correct
7 Correct 29 ms 141148 KB Output is correct
8 Correct 29 ms 141284 KB Output is correct
9 Correct 30 ms 141268 KB Output is correct
10 Correct 29 ms 141148 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 141148 KB Output is correct
2 Correct 28 ms 141400 KB Output is correct
3 Correct 30 ms 141148 KB Output is correct
4 Correct 32 ms 141148 KB Output is correct
5 Correct 29 ms 141148 KB Output is correct
6 Correct 29 ms 141148 KB Output is correct
7 Correct 29 ms 141148 KB Output is correct
8 Correct 29 ms 141284 KB Output is correct
9 Correct 30 ms 141268 KB Output is correct
10 Correct 29 ms 141148 KB Output is correct
11 Correct 31 ms 141400 KB Output is correct
12 Correct 34 ms 141812 KB Output is correct
13 Correct 34 ms 141916 KB Output is correct
14 Correct 35 ms 141912 KB Output is correct
15 Correct 35 ms 141976 KB Output is correct
16 Correct 34 ms 141908 KB Output is correct
17 Correct 32 ms 141660 KB Output is correct
18 Correct 37 ms 141908 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 974 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 241 ms 155376 KB Output is correct
2 Correct 205 ms 154976 KB Output is correct
3 Correct 166 ms 154872 KB Output is correct
4 Correct 179 ms 155344 KB Output is correct
5 Correct 172 ms 154988 KB Output is correct
6 Correct 144 ms 154836 KB Output is correct
7 Correct 142 ms 154908 KB Output is correct
8 Correct 150 ms 155008 KB Output is correct
9 Correct 61 ms 141564 KB Output is correct
10 Correct 141 ms 154804 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 141148 KB Output is correct
2 Correct 28 ms 141400 KB Output is correct
3 Correct 30 ms 141148 KB Output is correct
4 Correct 32 ms 141148 KB Output is correct
5 Correct 29 ms 141148 KB Output is correct
6 Correct 29 ms 141148 KB Output is correct
7 Correct 29 ms 141148 KB Output is correct
8 Correct 29 ms 141284 KB Output is correct
9 Correct 30 ms 141268 KB Output is correct
10 Correct 29 ms 141148 KB Output is correct
11 Correct 31 ms 141400 KB Output is correct
12 Correct 34 ms 141812 KB Output is correct
13 Correct 34 ms 141916 KB Output is correct
14 Correct 35 ms 141912 KB Output is correct
15 Correct 35 ms 141976 KB Output is correct
16 Correct 34 ms 141908 KB Output is correct
17 Correct 32 ms 141660 KB Output is correct
18 Correct 37 ms 141908 KB Output is correct
19 Correct 535 ms 169444 KB Output is correct
20 Correct 544 ms 169768 KB Output is correct
21 Correct 430 ms 169528 KB Output is correct
22 Correct 428 ms 169476 KB Output is correct
23 Correct 430 ms 169420 KB Output is correct
24 Correct 320 ms 169452 KB Output is correct
25 Correct 294 ms 169428 KB Output is correct
26 Correct 361 ms 169528 KB Output is correct
27 Correct 369 ms 169420 KB Output is correct
28 Correct 377 ms 169420 KB Output is correct
29 Correct 385 ms 169664 KB Output is correct
30 Correct 393 ms 169540 KB Output is correct
31 Correct 426 ms 169676 KB Output is correct
32 Correct 392 ms 169424 KB Output is correct
33 Correct 390 ms 169516 KB Output is correct
34 Correct 287 ms 169408 KB Output is correct
35 Correct 323 ms 169732 KB Output is correct
36 Correct 290 ms 169424 KB Output is correct
37 Correct 295 ms 169424 KB Output is correct
38 Correct 293 ms 169588 KB Output is correct
39 Correct 367 ms 169416 KB Output is correct
40 Correct 229 ms 157624 KB Output is correct
41 Correct 310 ms 169420 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 141148 KB Output is correct
2 Correct 28 ms 141400 KB Output is correct
3 Correct 30 ms 141148 KB Output is correct
4 Correct 32 ms 141148 KB Output is correct
5 Correct 29 ms 141148 KB Output is correct
6 Correct 29 ms 141148 KB Output is correct
7 Correct 29 ms 141148 KB Output is correct
8 Correct 29 ms 141284 KB Output is correct
9 Correct 30 ms 141268 KB Output is correct
10 Correct 29 ms 141148 KB Output is correct
11 Correct 31 ms 141400 KB Output is correct
12 Correct 34 ms 141812 KB Output is correct
13 Correct 34 ms 141916 KB Output is correct
14 Correct 35 ms 141912 KB Output is correct
15 Correct 35 ms 141976 KB Output is correct
16 Correct 34 ms 141908 KB Output is correct
17 Correct 32 ms 141660 KB Output is correct
18 Correct 37 ms 141908 KB Output is correct
19 Runtime error 974 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -