제출 #1336045

#제출 시각아이디문제언어결과실행 시간메모리
1336045yhkhooHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
34 / 100
3094 ms6288 KiB
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

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

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, q;
    cin >> n >> q;
    int w[n];
    for(int i=0; i<n; i++){
        cin >> w[i];
    }
    for(int i=0; i<q; i++){
        int l, r, m;
        cin >> l >> r >> m;
        l--; r--;
        int ma = -1;
        bool ans = 1;
        for(int j=l; j<=r; j++){
            if(w[j] < ma){
                if(w[j] + ma > m){
                    ans = 0;
                    break;
                }
            }
            else{
                ma = w[j];
            }
        }
        cout << ans << '\n';
    }
    return 0;
}
#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...