Submission #1171739

#TimeUsernameProblemLanguageResultExecution timeMemory
1171739coolboy19521Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
8 / 100
1 ms328 KiB
#include "bits/stdc++.h" #define mxN 502 using namespace std; int a[mxN]; int main(){ int N, M; cin >> N >> M; for (int i = 1; i <= N; i ++) cin >> a[i]; while (M --){ int L, R, K; cin >> L >> R >> K; int mx = 0; int ok = 1; for (int i = L; i <= R; i ++){ if (mx > a[i] && a[i] + mx > K) ok = 0; mx = max(mx, a[i]); } ok ? puts("1") : puts("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...