Submission #569654

#TimeUsernameProblemLanguageResultExecution timeMemory
569654SSRSHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
8 / 100
3077 ms14192 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 mx = 0;
    for (int x = l; x < r; x++){
      for (int y = x + 1; y < r; y++){
        if (w[x] > w[y]){
          mx = max(mx, w[x] + w[y]);
        }
      }
    }
    if (mx <= 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...