Submission #867667

#TimeUsernameProblemLanguageResultExecution timeMemory
86766712345678Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
8 / 100
3057 ms4352 KiB
#include <bits/stdc++.h> using namespace std; const int nx=1e6+5; int n, m, v[nx], l, r, k; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>m; for (int i=1; i<=n; i++) cin>>v[i]; while (m--) { cin>>l>>r>>k; int mx=0; pair<int, int> res={0, -1}; for (int i=l; i<=r; i++) { if (v[i]<mx) res=max(res, {v[i], v[i]+mx}); mx=max(mx, v[i]); } cout<<(res.second<=k)<<'\n'; } }
#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...