Submission #498162

#TimeUsernameProblemLanguageResultExecution timeMemory
498162AbdurahmonHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
2584 ms6264 KiB
#include<bits/stdc++.h>
using namespace std;
int a[1000000];
void solve()
{
	int 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();
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...