Submission #1096597

#	Time	Username	Problem	Language	Result	Execution time	Memory
1096597		rayan_bd	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3047 ms	22224 KiB

sortbooks

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; 


#define getar(ar,n) for(ll i=0;i<n;++i) cin>>ar[i]
#define show(n) cout<<n<<'\n'
#define all(v) v.begin(), v.end()
#define br cout<<"\n"
#define pb push_back
#define nl '\n'
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ret return
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())

const int mxN = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ld EPS = 1e-9;


void solve() {
    ll l,r,w,n,q;cin>>n>>q;
    ll ar[n+1];
    for(ll i=1;i<=n;++i){
    	cin>>ar[i];
    }
    while(q--){
    	cin>>l>>r>>w;
    	priority_queue<ll,vector<ll>,greater<ll>> q;
    	ll mn=INF,mx=0;
    	for(ll i=l;i<=r;++i){
    		q.push(ar[i]);
    		mn=min(mn,ar[i]);
    	}
    	bool good=1;
    	while(q.size()){
    		ll tp=q.top();
    		q.pop();
    		if(tp!=ar[l])mx=max(mx,ar[l]),good=0;
    		++l; 
    	}
    	if(mx+mn<=w||good) show(1);
    	else show(0);
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    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