Submission #1235998

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235998		ducngo	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	34 / 100	3094 ms	6248 KiB

sortbooks

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

constexpr int MAX_N = 1000000 + 6;

int N, Q;
int A[MAX_N];
int L, R, K;

void solve() {
	int maxA = A[L];
	for (int i = L + 1; i <= R; ++i) {
		if ((maxA > A[i]) && (maxA + A[i] > K)) {
			cout << "0\n";
			return;
		}
		maxA = max(maxA, A[i]);
	}
	cout << "1\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	cin >> N >> Q;
	for (int i = 1; i <= N; ++i) {
		cin >> A[i];
	}
	for (int i = 1; i <= Q; ++i) {
		cin >> L >> R >> K;
		solve();
	}
}

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