Submission #1093942

#TimeUsernameProblemLanguageResultExecution timeMemory
1093942stdfloatHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
8 / 100
3060 ms58960 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; l--; r--;

		set<int> s;
		bool tr = true;
		for (int i = r; i >= l && tr; i--) {
			tr = (s.empty() || a[i] <= *s.begin() || a[i] + *--lower_bound(s.begin(), s.end(), a[i]) <= k);
			s.insert(a[i]);
		}

		cout << tr << '\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...