제출 #979799

#제출 시각아이디문제언어결과실행 시간메모리
979799asdasdqwerHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
0 / 100
3041 ms11800 KiB
#include <bits/stdc++.h>
using namespace std;

signed main() {
    int n,m;cin>>n>>m;
    vector<int> a(n);
    for (auto &x:a)cin>>x;

    for (int i=0;i<m;i++) {
        vector<int> tmp;
        int l, r,k;cin>>l>>r>>k;l--;r--;
        for (int j=l;j<=r;j++) {
            tmp.push_back(a[j]);
        }

        vector<int> tmp2 = tmp;
        sort(tmp.begin(), tmp.end());
        int ans = 0;
        for (int j=0;j<(int)tmp.size();j++) {
            if (tmp[j] != tmp2[j]) {
                ans = max(ans, max(tmp[j], tmp2[j]));
            }
        }
        if (k >= ans) 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...