제출 #602257

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
602257		Ozy	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	34 / 100	3046 ms	8276 KiB

sortbooks

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 200000

int n,q,l,r,M,k;
int arr[MAX+2];
bool res;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> q;
    rep(i,1,n) cin >> arr[i];

    rep(Q,1,q) {
        cin >> l >> r >> k;
        M = 0;

        res = true;
        rep(i,l,r) {
            if (arr[i] >= M) M = arr[i];
            else if (arr[i]+M > k) {
                res = false;
                break;
            }
        }

        if (res) cout << "1\n";
        else cout << "0\n";
    }
}

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