제출 #1285118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285118		LIA	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3096 ms	8236 KiB

sortbooks

#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];
      loop(j, l, i) {
        if (mx>wi && (mx + wi > k))
          ans = 0;
      }
      mx = max(mx, wi);
    }

    cout << ans << "\n";
  }
  return 0;
}

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