Submission #499168

#	Time	Username	Problem	Language	Result	Execution time	Memory
499168		sireanu_vlad	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	34 / 100	3070 ms	6272 KiB

sortbooks

#include <iostream>
using namespace std;

int n, m, w[1000001], wmax, l, r, k;

void read()
{
	cin >> n >> m;
	for(int i = 1; i <= n; ++i)
		cin >> w[i];
}

bool solve()
{
	wmax = 0;
	cin >> l >> r >> k;
	for(int i = l; i <= r; ++i)
	{
		if(w[i] < wmax && wmax + w[i] > k) return 0;
		wmax = max(wmax, w[i]);
	}
	return 1;
}

int main()
{
	read();
	while(m--)
		cout << solve() << '\n';
	return 0;
}

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