Submission #503156

#	Time	Username	Problem	Language	Result	Execution time	Memory
503156		AzamatRustamov	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3075 ms	31668 KiB

sortbooks

#include <iostream>
using namespace std;

bool solve(int &n, int &m, int w[])
{
	int l, r, k;
	cin >> l >> r >> k;
	for (int i=r; i>l; i--)
	{
		int a = w[i-1], b = w[i];
		if (a>b && a+b>k) return 0;
	}
	return 1;
}

int main()
{
	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int n, m;
	cin >> n >> m;
	int w[n+1] = {-1};
	for (int i=1; i<=n; i++) cin >> w[i];
	for (int i=0; i<m; i++) cout << solve(n, m, w) << '\n';
}

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