제출 #928194

#제출 시각아이디문제언어결과실행 시간메모리
928194vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
8 / 100
3055 ms43292 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define int long long
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  
  int n, m;
  cin >> n >> m;
  int a[n + 2];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  while (m--) {
    int l, r, k;
    cin >> l >> r >> k;
    bool is = 1;
    for (int i = l; i <= r && is; i++) {
      for (int j = i + 1; j <= r && is; j++) {
        if (a[i] > a[j] && a[i] + a[j] > k) is = 0;
      }
    }
    cout << is << '\n';
  }
}
#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...