제출 #1335879

#제출 시각아이디문제언어결과실행 시간메모리
1335879itslqHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
13 / 100
1894 ms10252 KiB
#include "bits/stdc++.h"
using namespace std;

int main() {
    int N, M, l, r, k;
    cin >> N >> M;

    vector<int> W(N), eq(N);
    for (int i = 0; i < N; i++) {
        cin >> W[i];
        if (i) {
            eq[i] = (W[i] >= W[i - 1]);
            eq[i] += eq[i - 1];
        }
    }

    while (M--) {
        cin >> l >> r >> k;
        l--, r--;
        if (eq[r] - eq[l] == r - l) {
            cout << "1\n";
        } else {
            cout << "0\n";
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...