Submission #498676

#	Time	Username	Problem	Language	Result	Execution time	Memory
498676		Abdurahmon	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	650 ms	14436 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t[1000000];
void solve()
{
	int l,r,k;ll m=0;
	cin>>l>>r>>k;
	l--;r--;
	for(int c=l;c<=r;c++)
	{
		if(t[c]+m>k)
		{
			cout<<"0\n";return;
		}
		if(t[c]>m)
		{
			m=t[c];
		}
	}
	cout<<"1\n";
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n,m;
cin>>n>>m;
for(int c=0;c<n;c++)
{
	cin>>t[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