| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1357013 | camal1331 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++20 | 618 ms | 18060 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define NEGGERS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void solve(){
ll n;
cin>>n;
ll q;
cin>>q;
vector<ll>a(n+1) ;
for(ll i=1;i<=n;i ++) {
cin>>a[i] ;
}
vector<ll>pre(n+2,0);
for(ll i=2;i<=n;i++){
pre[i]=pre[i-1];
if(a[i]>=a[i-1]){
pre[i]++;
}
}
if(a[n]>=a[n-1]){
pre[n]=pre[n-1]+1;
}
while(q--){
ll l ,r,k;
cin>>l>>r>>k;
if(r-l==pre[r]-pre[l]){
cout<<1<<endl;
}
else{
cout<<0<<endl;
}
}
}
signed main(){
NEGGERS
ll tt=1;
//cin>>tt;
while(tt--){
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... | ||||
