Submission #508262

#TimeUsernameProblemLanguageResultExecution timeMemory
508262BelguteiHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
2 ms460 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define ff first #define ss second #define pb push_back #define mk make_pair #define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n,m; ll a[5005]; ll l,r,k; int main(){ IOS cin>>n>>m; for(int i=1; i<=n; i++){ cin>>a[i]; } while(m--){ cin>>l>>r>>k; ll mx=a[l]; ll mn=a[l]; bool ok=1; for(int i=l+1; i<=r; i++){ if(mx>a[i]){ if(mx-a[i]>k){ ok=0; break; } } if(mn<a[i]){ if(a[i]-mn>k){ ok=0; break; } } mx=max(mx,a[i]); mn=min(mn,a[i]); } cout<<ok<<'\n'; } }
#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...