제출 #1356773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1356773		Johan	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	34 / 100	3094 ms	10180 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
const int INF = 1e18;

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, q;
  cin >> n >> q;
  vector < int > a(n);
  for(int &i : a)cin >> i;
  while(q--){
    int l, r, k;
    cin >> l >> r >> k; 
    l--, r--;
    bool ok = true;
    int mx = 0;
    for(int i = l; i <= r && ok; i++){
      if(a[i] < mx && a[i] + mx > k)
        ok = false;
      mx = max(mx, a[i]);
    }
    cout << ok << endl;
  }
}

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