Submission #571445

#TimeUsernameProblemLanguageResultExecution timeMemory
571445AzamatRustamovHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
17 / 100
3089 ms6276 KiB
#include <iostream> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; int w[n+1]; for (int i=1; i<=n; i++) cin >> w[i]; while (m--) { int l, r, k, x; bool y=1; cin >> l >> r >> k; x = w[l]; for (int i=l+1; i<=r; i++) { if (x > w[i] && x + w[i] > k) { y = 0; break; } else if (x < w[i]) x = w[i]; } cout << y << '\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...