Submission #859688

#	Time	Username	Problem	Language	Result	Execution time	Memory
859688		Alfraganus	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3039 ms	39248 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define fastio ios::sync_with_stdio(0), cin.tie(0);
#define fs first
#define ss second

#define print(a)          \
    for (auto x : a)      \
        cout << x << ' '; \
    cout << endl;

#define printmp(a)   \
    for (auto x : a) \
        cout << x.fs << ' ' << x.ss << endl;

void solve()
{
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for(int i = 0; i < n; i ++)
        cin >> a[i];
    while(q --){
        int l, r, k;
        cin >> l >> r >> k;
        bool flag = 1;
        l --;
        r --;
        for(int i = l; i <= r; i ++){
            for(int j = i - 1; j >= l; j --){
                if(a[i] < a[j] and a[i] + a[j] > k){
                    flag = false;
                    break;
                }
            }
            if(!flag)
                break;
        }
        if(flag)
            cout << 1 << endl;
        else
            cout << 0 << endl;
    }
}

signed main()
{
    fastio
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
        cout << endl;
    }
}

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