Submission #860180

#	Time	Username	Problem	Language	Result	Execution time	Memory
860180		Halym2007	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++11	30 / 100	3028 ms	18216 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int a[N], p[N], cep[N];
int main () {
//	freopen ("input.txt", "r", stdin);
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	for (int i = 1; i <= n - 1; ++i) {
		if (a[i] > a[i + 1]) {
			p[i] = 1;
		}
	}
	for (int i = 1; i <= n; ++i) p[i] += p[i - 1];
	
	stack <int> s;
	for (int i = 1; i <= n; ++i) {
		cep[i] = -1;
		while (!s.empty() and a[s.top()] <= a[i]) s.pop();
		if (!s.empty()) {
			cep[i] = s.top();
		}
		s.push(i);
	}
	
	for (int i = 1; i <= m; ++i) {
		int	l, r, k;
		cin >> l >> r >> k;
		if (p[r - 1] - p[l - 1] == 0) {
			cout << "1\n";
			continue;
		}
		bool tr = 0;
		for (int j = l; j <= r; ++j) {
			if (cep[j] != -1) {
				if (cep[j] >= l and cep[j] <= r and a[cep[j]] + a[j] > k) {
					tr = 1;
					break;
				}
			}
		}
		if (tr) cout << "0\n";
		else cout << "1\n";
	}
}

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