제출 #991571

#제출 시각아이디문제언어결과실행 시간메모리
991571MardonbekhazratovHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3070 ms14576 KiB
#include<bits/stdc++.h> using namespace std; void solve(){ int n,m; cin>>n>>m; vector<int>a(n); for(int i=0;i<n;i++) cin>>a[i]; while(m--){ int l,r,k; cin>>l>>r>>k; --l; int mx=0; bool ans=true; for(int i=l;i<r;i++){ mx=max(a[i],mx); if(mx>a[i] && mx+a[i]>k) ans=false; } cout<<ans<<'\n'; } } signed main(){ int t=1; // cin>>t; while(t--){ solve(); cout<<'\n'; } return 0; }
#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...