Submission #992767

#	Time	Username	Problem	Language	Result	Execution time	Memory
992767		n3rm1n	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	13 / 100	298 ms	10172 KiB

sortbooks

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
using namespace std;
const int MAXN = 1e6+10;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
int n, m;
int a[MAXN], w;
int l, r, k;
int go[MAXN];
void read()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i];
    }
    int j = 1;
    for (int i = 1; i <= n; ++ i)
    {

            j = max(j, i);
            while(j < n && a[j] <= a[j+1])j ++;

        go[i] = j;
        //cout << go[i] << " ";
    }
    //cout << endl;
    for (int i = 1; i <= m; ++ i)
    {
        cin >> l >> r >> k;
        if(go[l] < r)cout << 0 << endl;
        else cout << 1 << endl;

    }
}
int main()
{
    speed();
    read();
    return 0;
}

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