Submission #499027

#TimeUsernameProblemLanguageResultExecution timeMemory
499027IOI_champion_in_1980Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
0 / 100
1641 ms6304 KiB
#include <bits/stdc++.h>
#include <math.h>
typedef long long ll;
using namespace std;
ll i, j, t, a, n, m, b, c, d, f, g;
int x[1000100], y[1000100];
int main()
{
    ios::sync_with_stdio(0);
	cin.tie(0);

	cin>>n>>m;
	for (a=1; a<=n; a++) cin>>x[a];
	for (a=1; a<=m; a++)
	{
		int l, r, k;
		cin>>l>>r>>k;
		int mmax=INT_MIN;
		int ans=1;
		for (b=r; b>=l; b--)
		{
			if (mmax<x[b])
			{
				if (mmax+x[b]>k)
				{
					ans=0;
					break;
				}
				mmax=x[b];
				continue;
			}
		}
		cout<<ans<<endl;
	}
}
/*

*/


#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...