Submission #569661

#TimeUsernameProblemLanguageResultExecution timeMemory
569661SSRSHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
17 / 100
3087 ms4628 KiB
#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M;
  cin >> N >> M;
  vector<int> w(N);
  for (int i = 0; i < N; i++){
    cin >> w[i];
  }
  for (int i = 0; i < M; i++){
    int l, r, k;
    cin >> l >> r >> k;
    l--;
    int mx1 = -1, mx2 = 0;
    for (int j = l; j < r; j++){
      if (w[j] >= mx1){
        mx1 = w[j];
      } else {
        mx2 = max(mx2, mx1 + w[j]);
      }
    }
    if (mx2 <= k){
      cout << 1 << endl;
    } else {
      cout << 0 << endl;
    }
  }
}
#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...