제출 #1122172

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122172		Luvidi	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3053 ms	33548 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve() {
    int n,q;
    cin>>n>>q;
    int a[n];
    for(int i=0;i<n;i++)cin>>a[i];
    while(q--){
        int l,r,k;
        cin>>l>>r>>k;
        l--;r--;
        int mx=0;
        set<int> s;
        for(int i=l;i<=r;i++){
            s.insert(a[i]);
            if(*s.rbegin()>a[i])mx=max(mx,a[i]+*s.rbegin());
        }
        if(mx<=k)cout<<"1\n";
        else cout<<"0\n";
    }
}

int main() {
    #ifdef FPO
        freopen("in","r",stdin);
        freopen("out","w",stdout);
    #endif
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

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