Submission #571433

#	Time	Username	Problem	Language	Result	Execution time	Memory
571433		AzamatRustamov	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	2719 ms	20488 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n, m;
	cin >> n >> m;
	int w[n];
	for (int i=0; i<n; i++) 
		cin >> w[i];
	while (m--)
	{
		int l, r, k, x, y=1;
		cin >> l >> r >> k;
		x = w[l];
		for (int i=l+1; i<=r; i++)
		{
			if (x > w[i] && x + w[i] > k)
			{
				y = 0;
				break;
			}
			else if (x < w[i]) x = w[i];
		}
		cout << y << '\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