oj.uz

Submission #951379

# Submission time Handle Problem Language Result Execution time Memory
951379 2024-03-21T18:31:31 Z nguyennh Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 919 ms 262144 KB 
#include<bits/stdc++.h>
#define el '\n'
using namespace std ;

mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

const int MN = 1e6 + 5;

const int inf = numeric_limits<int>::max();

int n , m , a[MN];

namespace sub_trau{
  bool valid_input(){
    return n <= 500 && m <= 500;
  }
  
  void solve(){
    while(m--){
      int l , r , k;
      cin >> l >> r >> k;
      int ans = 0;
      for ( int i = l ; i <= r ; i++ ){
        for ( int j = i ; j <= r ; j++ ){
          if (a[j] < a[i]) ans = max(ans , a[j] + a[i]);
        }
      }
      cout << (ans <= k ? 1 : 0) << el;
    }
  }
}

namespace sub2{
  bool valid_input(){
    return n <= 5000 && m <= 5000;
  }
  
  void solve(){
    while(m--){
      int l , r , k;
      cin >> l >> r >> k;
      int ans = 0;
      vector<int> pref(r + 3);
      pref[l - 1] = INT_MIN;
      pref[l] = a[l];
      for ( int i = l + 1 ; i <= r ; i++ ) pref[i] = max(pref[i - 1] , a[i]);
      for ( int i = l ; i <= r ; i++ ){
        if (pref[i - 1] > a[i]) ans = max(ans , a[i] + pref[i - 1]);
      }
      cout << (ans <= k ? 1 : 0) << el;
    }
  }
}

namespace sub_final{
  struct merge_sort_tree{
    #define lt(x) (x << 1)
    #define rt(x) (x << 1 | 1)
    vector<int> st[4 * MN];
    
    void build(int id , int l , int r){
      if (l == r){
        st[id].push_back(a[l]);
        return;
      }
      int mid = l + r >> 1;
      build(id << 1 , l , mid);
      build(id << 1 | 1 , mid + 1 , r);
      merge(st[lt(id)].begin() , st[lt(id)].end() , st[rt(id)].begin() , st[rt(id)].end() , back_inserter(st[id]));
    }
    
    int get(int id , int l , int r , int tl , int tr , int x){
      if (l > tr || r < tl) return -inf;
      else if (l >= tl && r <= tr){
        auto it = lower_bound(st[id].begin() , st[id].end() , x) - st[id].begin() - 1;
        if (it >= 0) return st[id][it];
        else return -inf;
      }
      int mid = l + r >> 1;
      return max(get(id << 1 , l , mid , tl , tr , x) , get(id << 1 | 1 , mid + 1 , r , tl , tr , x));
    }
  } mt;
  
  struct Segtri{
    struct Node{
      int l , r , best , max_val;
      Node () {};
      Node (int _l , int _r , int _b , int _m) : l(_l) , r(_r) , best(_b) , max_val(_m) {};
    };
    
    Node merge(const Node &x , const Node &y){
      Node c;
      c.l = x.l;
      c.r = y.r;
      c.max_val = max(x.max_val , y.max_val);
      c.best = max(x.best , y.best);
      int cur = mt.get(1 , 1 , n , y.l , y.r , x.max_val);
      c.best = max(c.best , x.max_val + cur);
      return c;
    }
    
    vector<Node> st;
    
    Segtri(int n) : st(4 * n + 5) {};
    
    void build(int id , int l , int r){
      if (l == r){
        st[id] = {l , l , 0 , a[l]};
        return;
      }
      int mid = l + r >> 1;
      build(id << 1 , l , mid);
      build(id << 1 | 1 , mid + 1 , r);
      st[id] = merge(st[id << 1] , st[id << 1 | 1]);
    }
    
    Node get(int id , int l , int r , int tl , int tr){
      if (l >= tl && r <= tr) return st[id];
      else {
        int mid = l + r >> 1;
        if (tl > mid) return get(id << 1 | 1 , mid + 1 , r , tl , tr);
        else if (tr <= mid) return get(id << 1 , l , mid , tl , tr);
        else return merge(get(id << 1 , l , mid , tl , tr) , get(id << 1 | 1 , mid + 1 , r , tl , tr));
      }
    }
  };
  
  void solve(){
    mt.build(1 , 1 , n);
    Segtri it(n);
    it.build(1 , 1 , n);
    while(m--){
      int l , r , k;
      cin >> l >> r >> k;
      cout << (it.get(1 , 1 , n , l , r).best <= k ? 1 : 0) << el;
    }
  }
}

int32_t main (){
//  freopen("sortbook.inp" , "r" , stdin);
//  freopen("sortbook.out" , "w" , stdout);
  ios_base::sync_with_stdio(0); 
  cin.tie(0);
  cin >> n >> m;
  for ( int i = 1 ; i <= n ; i++ ) cin >> a[i];
  if (sub_trau::valid_input()){
    sub_trau::solve();
    return 0;
  }
  if (sub2::valid_input()){
    sub2::solve();
    return 0;
  }
  sub_final::solve();
}

Compilation message

sortbooks.cpp: In member function 'void sub_final::merge_sort_tree::build(int, int, int)':
sortbooks.cpp:66:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |       int mid = l + r >> 1;
      |                 ~~^~~
sortbooks.cpp: In member function 'int sub_final::merge_sort_tree::get(int, int, int, int, int, int)':
sortbooks.cpp:79:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   79 |       int mid = l + r >> 1;
      |                 ~~^~~
sortbooks.cpp: In member function 'void sub_final::Segtri::build(int, int, int)':
sortbooks.cpp:111:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  111 |       int mid = l + r >> 1;
      |                 ~~^~~
sortbooks.cpp: In member function 'sub_final::Segtri::Node sub_final::Segtri::get(int, int, int, int, int)':
sortbooks.cpp:120:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  120 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 94800 KB Output is correct
2 Correct 24 ms 94808 KB Output is correct
3 Correct 24 ms 94936 KB Output is correct
4 Correct 21 ms 94812 KB Output is correct
5 Correct 23 ms 94812 KB Output is correct
6 Correct 42 ms 95028 KB Output is correct
7 Correct 43 ms 94812 KB Output is correct
8 Correct 60 ms 95008 KB Output is correct
9 Correct 29 ms 94812 KB Output is correct
10 Correct 46 ms 95004 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 94800 KB Output is correct
2 Correct 24 ms 94808 KB Output is correct
3 Correct 24 ms 94936 KB Output is correct
4 Correct 21 ms 94812 KB Output is correct
5 Correct 23 ms 94812 KB Output is correct
6 Correct 42 ms 95028 KB Output is correct
7 Correct 43 ms 94812 KB Output is correct
8 Correct 60 ms 95008 KB Output is correct
9 Correct 29 ms 94812 KB Output is correct
10 Correct 46 ms 95004 KB Output is correct
11 Correct 29 ms 95068 KB Output is correct
12 Correct 39 ms 94812 KB Output is correct
13 Correct 44 ms 94808 KB Output is correct
14 Correct 57 ms 94812 KB Output is correct
15 Correct 62 ms 95044 KB Output is correct
16 Correct 85 ms 94812 KB Output is correct
17 Correct 74 ms 95068 KB Output is correct
18 Correct 88 ms 95056 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 470 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 362 ms 113212 KB Output is correct
2 Correct 374 ms 114124 KB Output is correct
3 Correct 356 ms 113456 KB Output is correct
4 Correct 394 ms 114136 KB Output is correct
5 Correct 327 ms 112736 KB Output is correct
6 Correct 363 ms 113864 KB Output is correct
7 Correct 388 ms 113928 KB Output is correct
8 Correct 280 ms 113468 KB Output is correct
9 Correct 68 ms 95192 KB Output is correct
10 Correct 268 ms 114084 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 94800 KB Output is correct
2 Correct 24 ms 94808 KB Output is correct
3 Correct 24 ms 94936 KB Output is correct
4 Correct 21 ms 94812 KB Output is correct
5 Correct 23 ms 94812 KB Output is correct
6 Correct 42 ms 95028 KB Output is correct
7 Correct 43 ms 94812 KB Output is correct
8 Correct 60 ms 95008 KB Output is correct
9 Correct 29 ms 94812 KB Output is correct
10 Correct 46 ms 95004 KB Output is correct
11 Correct 29 ms 95068 KB Output is correct
12 Correct 39 ms 94812 KB Output is correct
13 Correct 44 ms 94808 KB Output is correct
14 Correct 57 ms 94812 KB Output is correct
15 Correct 62 ms 95044 KB Output is correct
16 Correct 85 ms 94812 KB Output is correct
17 Correct 74 ms 95068 KB Output is correct
18 Correct 88 ms 95056 KB Output is correct
19 Correct 915 ms 133320 KB Output is correct
20 Correct 879 ms 134288 KB Output is correct
21 Correct 803 ms 133316 KB Output is correct
22 Correct 802 ms 132976 KB Output is correct
23 Correct 819 ms 133664 KB Output is correct
24 Correct 748 ms 133052 KB Output is correct
25 Correct 778 ms 134564 KB Output is correct
26 Correct 827 ms 133016 KB Output is correct
27 Correct 811 ms 134340 KB Output is correct
28 Correct 893 ms 133316 KB Output is correct
29 Correct 830 ms 133884 KB Output is correct
30 Correct 831 ms 133960 KB Output is correct
31 Correct 919 ms 133848 KB Output is correct
32 Correct 861 ms 134244 KB Output is correct
33 Correct 836 ms 134852 KB Output is correct
34 Correct 753 ms 133520 KB Output is correct
35 Correct 751 ms 135080 KB Output is correct
36 Correct 746 ms 133672 KB Output is correct
37 Correct 750 ms 134580 KB Output is correct
38 Correct 760 ms 134852 KB Output is correct
39 Correct 720 ms 134088 KB Output is correct
40 Correct 407 ms 116424 KB Output is correct
41 Correct 646 ms 134352 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 94800 KB Output is correct
2 Correct 24 ms 94808 KB Output is correct
3 Correct 24 ms 94936 KB Output is correct
4 Correct 21 ms 94812 KB Output is correct
5 Correct 23 ms 94812 KB Output is correct
6 Correct 42 ms 95028 KB Output is correct
7 Correct 43 ms 94812 KB Output is correct
8 Correct 60 ms 95008 KB Output is correct
9 Correct 29 ms 94812 KB Output is correct
10 Correct 46 ms 95004 KB Output is correct
11 Correct 29 ms 95068 KB Output is correct
12 Correct 39 ms 94812 KB Output is correct
13 Correct 44 ms 94808 KB Output is correct
14 Correct 57 ms 94812 KB Output is correct
15 Correct 62 ms 95044 KB Output is correct
16 Correct 85 ms 94812 KB Output is correct
17 Correct 74 ms 95068 KB Output is correct
18 Correct 88 ms 95056 KB Output is correct
19 Runtime error 470 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -