Submission #1160104

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160104		MPG	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	104 ms	18436 KiB

sortbooks

//#pragma GCC optomize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long       ll;
#define     max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define     min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
#define     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define     filE freopen("in.txt", "r", stdin); freopen("out1.txt", "w", stdout); 
#define     endl '\n'
#define     md(a) (a % mod + mod) % mod
#define     pb push_back
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//cout << setprecision(5) << fixed << f;
//hash prime = 769


ll const maxn = 2e5 + 123;
ll const inf = 2e18;
ll const loG = 23;
//ll const mod = 1e9 + 7;
ll const mod = 998244353;
ll const sq = 400;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}




ll n, q, arr[maxn], op[maxn * 4], sz = 2;
vector <ll> seg;

void propogate(ll x, ll lx, ll rx){
    if (rx - lx == 1)
        return;
    if (op[x] == 0)
        return;
    ll a = 2 * x + 1, b = a + 1;
    seg[a] = max(seg[a], op[x]);
    seg[b] = max(seg[b], op[x]);
    op[a] = max(op[a], op[x]);
    op[b] = max(op[b], op[x]);
    op[x] = 0;
}


void setter(ll l, ll r, ll val, ll x, ll lx, ll rx){
    propogate(x, lx, rx);
    if (l >= rx || lx >= r)
        return;
    if (l <= lx && rx <= r){
        seg[x] = max(seg[x], val);
        op[x] = val;
        return;
    }
    ll mid = (lx + rx) / 2, a = 2 * x + 1, b = a + 1;
    setter(l, r, val, a, lx, mid);
    setter(l, r, val, b, mid, rx);
    seg[x] = max(seg[a], seg[b]);
}

ll get(ll l, ll r, ll x, ll lx, ll rx){
    propogate(x, lx, rx);
    if (l >= rx || lx >= r)
        return 0;
    if (l <= lx && rx <= r){
        return seg[x];
    }
    ll mid = (lx + rx) / 2, a = 2 * x + 1, b = a + 1;
    ll val1 = get(l, r, a, lx, mid);
    ll val2 = get(l, r, b, mid, rx);
    return max(val1, val2);
}




void Solve(){

cin >> n >> q;
while (sz <= n)
    sz = sz * 2;
seg.resize(2 * sz);
for (int i = 1; i < n + 1; i++)
    cin >> arr[i];
vector <ll> stk; stk.clear();
for (int i = 1; i < n + 1; i++){
    while (stk.size() && arr[stk.back()] <= arr[i]){
        stk.pop_back();
    }
    if (stk.size()){
        setter(stk.back(), i + 1, arr[stk.back()] + arr[i], 0, 0, sz);
    }
    stk.pb(i);
}
stk.clear();
for (int i = n; i > 0; i--){
    while (stk.size() && arr[stk.back()] >= arr[i])
        stk.pop_back();
    if (stk.size()){
        setter(i, stk.back() + 1, arr[stk.back()] + arr[i], 0, 0, sz);
    }
    stk.pb(i);
}
while (q--){
    ll l, r, k; cin >> l >> r >> k;
    ll x = get(l, r + 1, 0, 0, sz);
    if (x <= k)
        cout << 1 << endl;
    else
        cout << 0 << endl;
}


}





int main(){
sariE;// filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

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