Submission #341845

#TimeUsernameProblemLanguageResultExecution timeMemory
341845boykutHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
8 / 100
3071 ms4204 KiB
#include <bits/stdc++.h>

using namespace std;

#define work_with_io ios::sync_with_stdio(0);cin.tie(0);
//#define int long long

void solve() {
	int n, m;
	cin >> n >> m;
	int a[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int tmp=m;tmp--;) {
		int l, r, k;
		cin >> l >> r >> k;
		l--;r--;
		int ans = 1;
		for (int left = l; left <= r; left++) {
			for (int right = left + 1; right <= r; right++) {
				if (a[left] > a[right] && a[left] + a[right] > k)
					ans = 0;
			}
		}
		cout << ans << '\n';
	}
	return;
}

signed main() {
	//std::work_with_io;
	int q = 1;
	//cin >> q;
	while (q--) {
		solve();
	}
	return 0;
}
#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...