Submission #1093932

#TimeUsernameProblemLanguageResultExecution timeMemory
1093932stdfloatHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
3036 ms14632 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n, q;
	cin >> n >> q;

	vector<int> a(n);
	for (auto &i : a)
		cin >> i;

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

		while (l < r && a[r - 1] <= a[r]) r--;

		int mn = (int)1e9, mx = 0;
		while (l <= r) {
			mn = min(mn, a[l]);
			mx = max(mx, a[l++]);
		}

		cout << (mn + mx <= k) << '\n';
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...