#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
signed main(){
ios_base::sync_with_stdio();
cin.tie(0);cout.tie(0);
int n,q;
cin>>n>>q;
vector <int> a(n+1);
for(int i=1;i<=n;i++)cin>>a[i];
while(q--){
int l,r,x;
cin>>l>>r>>x;
vector <int> v;
for(int i=l;i<=r;i++)v.pb(a[i]);
bool ok=1;
set <int> st;
for(int i=v.size()-1;i>=0;i--){
auto it=st.lower_bound(v[i]);
int mx_mn=0;
if(it!=st.begin()){
it--;
mx_mn=*it;
}
if(it!=st.begin() && v[i]+mx_mn>x)ok=0;
st.insert(v[i]);
}
cout<<ok<<"\n";
}
}
/*
5 2
3 5 1 8 2
1 3 6
2 5 3
7 1
2 8 9 8 10 3 1
1 7 12
2 8 9 8 10 1 3
2 8 9 8 1 3 10
2 8 9 1 3 8 10
2 8 1 3 8 9 10
2 1 3 8 8 9 10
1 2 3 8 8 9 10
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3033 ms |
42272 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3057 ms |
3040 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |