Submission #342209

#	Time	Username	Problem	Language	Result	Execution time	Memory
342209		SeDunion	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3097 ms	6916 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 66;

// l<=i<=j<=r a[i] > a[j] a[i]+a[j]<=x

int a[N];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 1 ; i <= n ; ++ i) cin >> a[i];
	for (int i = 1 ; i <= m ; ++ i) {
		int l, r, k;
		cin >> l >> r >> k;
		bool Ans = true;
		int Mx = 0;
		for (int i = l ; i <= r ; ++ i) {
			if (Mx > a[i] && Mx + a[i] > k) {
				Ans = false;
				break;
			}
			Mx = max(Mx, a[i]);
		}
		cout << Ans << "\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