Submission #825950

#	Time	Username	Problem	Language	Result	Execution time	Memory
825950		borisAngelov	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3070 ms	39156 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1000005;

int n, q;

int a[maxn];

void solve(int l, int r, int k)
{
    for (int j = l; j <= r; ++j)
    {
        for (int p = j + 1; p <= r; ++p)
        {
            if (a[j] > a[p] && a[j] + a[p] > k)
            {
                cout << 0 << "\n";
                return;
            }
        }
    }

    cout << 1 << "\n";
}

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> q;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }

    for (int i = 1; i <= q; ++i)
    {
        int l, r, k;
        cin >> l >> r >> k;
        solve(l, r, k);
    }

    return 0;
}

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