| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 890355 | vjudge1 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define inf INFINITY
#define pb push_back
#define F first
#define S second
const int N = 1e9+10;
using namespace std;
ll n,q,a[N],l,r,k,mx,mn;
pair <int,int> b[N];
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;
for(int i=l;i<=r;i++){
b[i-l+1].F=a[i];
b[i-l+1].S=i;
}
sort(b+1,b+r-l+2);
for(int i=l;i<=r;i++){
for(int j=i;j<=b[i-l+1].S;j++){
mx=max(mx,abs(b[i-l+1].F+a[j]));
}
}
if(mx>k)cout<<0<<'\n';
else cout<<1<<'\n';
}
return 0;
}