This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |