Submission #1217264

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217264		lopkus	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	3095 ms	4364 KiB

sortbooks

#include <bits/stdc++.h>

signed main() {
  int n, q;
  std::cin >> n >> q;
  std::vector<int> a(n + 1);
  for(int i = 1; i <= n; i++) {
    std::cin >> a[i];
  }
  while(q--) {
    int l, r, x;
    std::cin >> l >> r >> x;
    int mx = 0;
    int ans = 0;
    for(int i = l; i <= r; i++) {
      if(mx >= a[i]) {
        ans = std::max(ans, mx + a[i]);
      }
      mx = std::max(mx, a[i]);
    }
    if(ans <= x) {
      std::cout << 1 << "\n";
    }
    else {
      std::cout << 0 << "\n";
    }
  }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23