제출 #928279

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928279		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	412 ms	17924 KiB

sortbooks

#include <bits/stdc++.h>
#define noSuccess t--
#define int long long
#define pb push_back 
#define pf push_front
#define F first	
#define S second
#define highspeed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(s) s.begin(),s.end()
#define sr(a) sort(a+1,a+1+n);reverse(a+1,a+1+n)
#define s(a) sort(a+1,a+1+n)
#define in insert
#define upb upper_bound
#define issrt(a) is_sorted(a+1,a+1+n)
#define yes "YES\n"
#define no "NO\n"
#define sz size
#define pii pair<int,int>
 
 
 
using namespace std;
const int maxn = 1e6 + 4;
int p[maxn];
void tryAgain(){
  int n,m;
  cin>>n>>m;
  int a[n+5];
  cin>>a[1];
  for(int i=2;i<=n;i++){
    cin>>a[i];
    int cal=0;
    if(a[i]<a[i-1]) cal=1;
    p[i]=p[i-1]+cal;
  }
  if(issrt(a)){
    while(m--) cout<<1<<'\n';
    return;
  }
  for(int i=1;i<=m;i++){
    int l,r,v;
    cin>>l>>r>>v;
    if(p[r] - p[l - 1] > 0) cout<<0<<'\n';
    else cout<<1<<'\n';
  }
}
signed main(){
  // freopen("something", "r", stdin);
  // freopen("something", "w", stdout);
	highspeed	
	int t = 1;
  //cin >> t;	
	while(noSuccess){
		tryAgain();
	}
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23