Submission #867666

#	Time	Username	Problem	Language	Result	Execution time	Memory
867666		12345678	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3043 ms	4860 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5;
int n, m, v[nx], l, r, k;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>v[i];
    while (m--)
    {
        cin>>l>>r>>k;
        int mx=0;
        pair<int, int> res={0, 0};
        for (int i=l; i<=r; i++) 
        {
            if (v[i]<mx) res=max(res, {v[i], v[i]+mx});
            mx=max(mx, v[i]);
        }
        cout<<(res.second<=k)<<'\n';
    }
}

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