Submission #979810

#	Time	Username	Problem	Language	Result	Execution time	Memory
979810		asdasdqwer	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3042 ms	18664 KiB

sortbooks

#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 (ans != 0) {
            ans += tmp[0];
        }

        if (k >= ans) cout<<"1\n";
        else cout<<"0\n";
    }    
}

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