제출 #1356750

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

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define ll int
#define endl "\n"
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(a) a.begin() , a.end()
const ll INF = 1e9 + 5 ;
signed main() {
  IO ;
  ll n ;
  cin >> n ;
  ll q ;
  cin >> q ;
  vector<ll>a(n + 1) ;
  for(ll i = 1 ; i <= n ; i ++) {
    cin >> a[i] ;
  }
  while(q --) {
    bool ok=1;
    ll l,r,k;
    cin>>l>>r>>k;
    multiset<ll>mst;
    for(ll i=l;i<=r;i++){
      auto it=upper_bound(mst.begin(),mst.end(),a[i]);
      if(it!=mst.end()){
        auto it1=--mst.end();
        if(*it1+a[i]>k){
          ok=0;
        }
      }
      mst.insert(a[i]);
    }
    if(ok) cout<<1<<endl;
    else cout<<0<<endl;
  }
}

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