Submission #1285119

#TimeUsernameProblemLanguageResultExecution timeMemory
1285119LIAHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3094 ms8264 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define loop(i, s, e) for (ll i = s; i < e; ++i)

int main() {
  ll n, m;
  cin >> n >> m;
  vll w(n);
  loop(i, 0, n) cin >> w[i];
  while (m--) {
    ll l, r, k;
    cin >> l >> r >> k;
    bool ans = 1;
    l--, r--;
    ll mx = 0;
    loop(i, l, r + 1) {
      ll wi = w[i];
      if (mx > wi && (mx + wi > k))
        ans = 0;

      mx = max(mx, wi);
    }

    cout << ans << "\n";
  }
  return 0;
}
#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...