Submission #889913

#TimeUsernameProblemLanguageResultExecution timeMemory
889913vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
2520 ms1368 KiB
#include <bits/stdc++.h>
#define ll long long
#define inf INFINITY
#define pb push_back
#define F first
#define S second
const int N = 1e5+1;
using namespace std;
int n,q,a[N],l,r,k,mx,mn;
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	while(q--){
		cin>>l>>r>>k;
		mx=0;mn=N;
		for(int i=l;i<=r;i++){
			mx=max(mx,a[i]);
			mn=min(mn,a[i]);
		}
		if(mx+mn<=k)cout<<1<<'\n';
		else cout<<0<<'\n';
	}
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...