Submission #1047814

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047814		TAhmed33	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++98	17 / 100	3074 ms	14416 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 25;
int n, q, a[MAXN];
void solve () {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	while (q--) {
		int l, r, x; cin >> l >> r >> x;
		int mx = 0; bool flag = 1;
		for (int i = l; i <= r; i++) {
			mx = max(mx, a[i]);
			if (mx > a[i]) {
				flag &= mx + a[i] <= x;
			}
		}
		cout << flag << '\n';
	}
}		
signed main () {
	ios::sync_with_stdio(0); cin.tie(0);
	int tc = 1; //cin >> tc;
	while (tc--) solve();
}

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