Submission #1156478

#TimeUsernameProblemLanguageResultExecution timeMemory
1156478MuhammadSaramHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
17 / 100
3095 ms8260 KiB
#include <bits/stdc++.h> using namespace std; signed main() { int n,m; cin>>n>>m; int a[n+1],pr[n+1]={}; for (int i=1;i<=n;i++) { cin>>a[i]; for (int j=i-1;j>=1;j--) if (a[j]>a[i]) { pr[i]=j; break; } } while (m--) { int l,r,k; cin>>l>>r>>k; int ans=1; for (int i=l;i<=r;i++) if (pr[i]>=l && a[i]+a[pr[i]]>k) ans=0; cout<<ans<<endl; } 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...