Submission #1071503

#TimeUsernameProblemLanguageResultExecution timeMemory
1071503vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
3032 ms10612 KiB
#include <bits/stdc++.h> #define int long long #define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define file(s) freopen(s".in", "r", stdin); freopen(s".out", "w", stdout) const int N=1e6+1; const int inf=1e18; const int mod=1e9+7; using namespace std; struct edge{ int mn,mx,ps; }; vector<int>v; vector<int>v1; signed main(){ boost; int n,m; cin>>n>>m; v.push_back(0); for(int i=1;i<=n;i++){ int x; cin>>x; v.push_back(x); } while(m--){ int l,r,k; cin>>l>>r>>k; if(l==r){ cout<<1<<"\n"; continue; } int ok=0; int mx=0; for(int i=l;i<=r;i++){ if(i!=l){ if(v[i]<v[i-1]&&v[i]+mx>k){ ok=1; break; } } mx=max(mx,v[i]); } if(ok==0){ cout<<1<<"\n"; }else{ cout<<0<<"\n"; } v1.clear(); } }
#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...