Submission #341846

#	Time	Username	Problem	Language	Result	Execution time	Memory
341846		boykut	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3089 ms	10128 KiB

sortbooks

#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, mna = -1;
	cin >> n >> m;
	int a[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		if (mna == -1 || a[i] < mna)
			mna = a[i];
	}
	int dp[n];
	dp[0] = 1;
	for (int i = 1; i < n; i++) {
		if (a[i] >= a[i - 1])
			dp[i] = dp[i - 1] + 1;
		else
			dp[i] = 1;
	}
	for (int tmp=m;tmp--;) {
		int l, r, k;
		cin >> l >> r >> k;
		l--;r--;
		if (k < mna) {
			r-l+1 <= dp[r]?cout << "1\n":cout << "0\n";
			continue;
		}
		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;
}

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