Submission #1096610

#TimeUsernameProblemLanguageResultExecution timeMemory
1096610rayan_bdHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
13 / 100
318 ms50772 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; #define getar(ar,n) for(ll i=0;i<n;++i) cin>>ar[i] #define show(n) cout<<n<<'\n' #define all(v) v.begin(), v.end() #define br cout<<"\n" #define pb push_back #define nl '\n' #define yes cout<<"YES\n" #define no cout<<"NO\n" #define ret return #define ll long long #define ld long double #define sza(x) ((int)x.size()) const int mxN = 1e5 + 5; const ll MOD = 1e9 + 7; const ll INF = 1e18; const ld EPS = 1e-9; void solve() { ll l,r,w,n,q;cin>>n>>q; ll ar[n+1],p[n+1];p[0]=0; for(ll i=1;i<=n;++i){ cin>>ar[i]; p[i]=p[i-1]+(ar[i]<ar[i-1]); } while(q--){ cin>>l>>r>>w; cout<<(p[r]-p[l]==0||(r-l)==0)<<nl; } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; }
#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...