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>
using namespace std;
#define endl '\n'
struct MST{
int n;
vector<vector<int>> seg;
void init(int n1){
n = 1;
while(n < n1) n*=2;
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,q; cin>>n>>q;
vector<int> v(n); for(int& i : v) cin>>i;
vector<int> pre(n+1);
for(int i = 1; i<n; i++){
pre[i+1] = pre[i] + (v[i] < v[i-1]);
}
while(q--){
int l,r,k; cin>>l>>r>>k;
if(n > 600){
if(pre[r] - pre[l] == 0) cout<<1<<endl;
else cout<<0<<endl;
}
else{
l--; r--;
int mx = 0;
for(int i = l; i <= r; i++){
for(int j = i+1; j<=r; j++){
if(v[i] > v[j]) mx = max(mx,v[i] + v[j]); // ill have to swap them
}
}
if(mx > k) cout<<0<<endl;
else cout<<1<<endl;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |