Submission #1138680

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138680		AHOKA	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	17 / 100	3094 ms	2180 KiB

sortbooks

#pragma GCC optimize("O3") 

#include <bits/stdc++.h>

using namespace std;
 
#define threesum cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false)
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define int long long
#define double long double
#define pii pair<int, int>
#define ppp pair<int, pii>
#define dout cout << fixed << setprecision(15)
#define mid ((l + r) / 2)
#define lc (2 * id)
#define rc (lc + 1)

const int maxn = 2e5 + 10, maxm = 5e3 + 10, oo = 1e18 + 10, lg = 18, sq = 350, mod = 998244353;

int n, m;

int a[maxn];

signed main()
{
	threesum;
    cin >> n >> m;
    for (int i = 1; i <= n;i++)
        cin >> a[i];

    while(m--){
        int l, r, k;
        cin >> l >> r >> k;

        int mx = 0;
        bool f = 1;

        for (int i = l; i <= r; i++)
        {
            mx = max(mx, a[i]);
            if(mx > a[i])
                f &= (a[i] + mx <= k);
        }

        cout << f << "\n";
    }
}

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