Submission #1172114

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172114		Hurryup_7735	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	17 / 100	3096 ms	174660 KiB

sortbooks

//In The Name Of ALLAH!
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace __gnu_pbds;
using namespace std;

#define ll long long
#define ld long double
#define endl '\n'
#define pb push_back
#define pf push_front
#define speedyboy ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define bpc __builtin_popcount
#define all(x) x.begin() , x.end()
#define allr(x) x.rbegin() , x.rend()
#define F first
#define S second
#define pll pair<ll , ll>
#define turtle tuple<ll , ll , ll>
#define pss pair<string , string>
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define ordered_set tree<ll , null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update>


const ll sz = 1e6 + 5 , INF = 1e18 ,  MOD = 998244353;
ll a[sz] , lg[sz] , pw[sz] , st[sz][20];

ll query(ll l , ll r){
    ll x = lg[r - l + 1];
    return max(st[l][x] , st[r - pw[x] + 1][x]);
}

ll mask , i , j , o;
void solve(){
    ll n , q;
    cin >> n >> q;
    for(i = 1 ; i <= n ; i++) cin >> a[i] , st[i][0] = a[i];
    for(j = 1 ; j < 20 ; j++){
        for(i = 1 ; i + pw[j] - 1 <= n ; i++){
            st[i][j] = max(st[i][j - 1] , st[i + pw[j - 1]][j - 1]);
        }
    }
    while(q--){
        ll l , r , k; cin >> l >> r >> k;
        bool ok = true;
        for(i = l + 1 ; i <= r ; i++){
            ll x = query(l , i - 1);
            if(x > a[i] && x + a[i] > k){
                ok = false;
                break;
            }
        }
        cout << ok << endl;
    }
}

signed main(){
    lg[1] = 0;
    for(i = 2 ; i < sz ; i++) lg[i] = lg[i / 2] + 1;
    for(i = 0 ; i < 20 ; i++) pw[i] = 1 << i;
    speedyboy;
    //open;
    ll t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23