Submission #867662

#	Time	Username	Problem	Language	Result	Execution time	Memory
867662		12345678	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	13 / 100	354 ms	43136 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>v[i];
    for (int i=1; i<=n; i++)
    {
        if (v[i]>=v[i-1]) dp[i]=dp[i-1];
        else dp[i]=i;
    }
    while (m--)
    {
        cin>>l>>r>>k;
        cout<<(dp[r]<=l)<<'\n';
    }
}

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