Submission #498165

#	Time	Username	Problem	Language	Result	Execution time	Memory
498165		Abdurahmon	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	2565 ms	10132 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
long long a[1000000];
void solve()
{
	long long l,r,k,m=0;
	cin>>l>>r>>k;
	r--;l--;
	for(int c=r;c>=l;c--)
	{
		if(a[c]>m)
		{
			if(a[c]+m>k)
			{
				cout<<0<<"\n";
				return;
			}
			m=a[c];
		}
	}
	cout<<1<<"\n";
	
}
int main()
{
	int n,m;
	cin>>n>>m;
	for(int c=0;c<n;c++)
	{
		cin>>a[c];
	}
	while(m--)
	{
		solve();
	}
}

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