Submission #989744

#	Time	Username	Problem	Language	Result	Execution time	Memory
989744		tch1cherin	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3080 ms	5460 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
 
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  vector<int> W(N);
  for (int &value : W) {
    cin >> value;
  }
  while (M--) {
    int L, R, K;
    cin >> L >> R >> K;
    L--, R--;
    int current = 0;
    bool good = true;
    for (int i = L; i <= R; i++) {
      current = max(current, W[i]);
      if (W[i] < current) {
        if (W[i] + current > K) {
          good = false;
        }
      }
    }
    cout << int(good) << "\n";
  }
}

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