Submission #1195529

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

sortbooks

#include <bits/stdc++.h>

#define int int64_t

void solve() {
  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, k;
    std::cin >> l >> r >> k;
    int mx = a[l];
    int can = 1;
    for(int i = l + 1; i <= r; i++) {
      if(mx > a[i] + k) {
        can = 0;
        break;
      }
      mx = std::max(mx, a[i]);
    }
    std::cout << can << "\n";
  }
}


signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t = 1;
  //std::cin >> t;
  while (t--) {
      solve();
  }

  return 0;
}

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