#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 1e6;
const int M = 1e9+7;
int n, q;
int a[N], pref[N], sum[N];
int get_sum(int l,int r){
return (sum[r] - (l > 0 ? sum[l-1] : 0));
}
main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> q;
int mn = INT_MAX;
for(int i = 0;i < n; i++){
cin >> a[i];
sum[i] = a[i] + (i > 0 ? sum[i-1] : 0);
mn = min(mn, a[i]);
}
for(int i = 0;i < n-1; i++){
if(i == 0){
pref[i] = (a[i+1]>=a[i]);
}else{
pref[i] = pref[i-1]+ (a[i+1]>= a[i]);
}
}
while(q--){
int l, r, k; cin >> l >> r >> k; l--, r--;
if(r-l+1 == 1){
cout << 1 << '\n';
continue;
}
if(mn > k){
int L = max(0, l-1);
int R = max(0, r-1);
if(pref[R]-pref[L] == R-L+1){
cout << 1;
}else{
cout << 0;
}
cout << '\n';
}else{
}
}
return 0;
}
Compilation message
sortbooks.cpp:17:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
17 | main(){
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
468 ms |
31600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
3428 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |