Submission #173063

#	Time	Username	Problem	Language	Result	Execution time	Memory
173063		LinusTorvaldsFan	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3038 ms	29244 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	int n,m;
	cin>>n>>m;
	vector<int>a(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	set<pair<int,int>> segments;
	for(int i=0;i<n;){
		int j=i;
		while(j+1<n && a[j+1]>=a[j]){
			j++;
		}
		segments.emplace(i,j);
		i=j+1;
	}
	for(;m;m--){
		int l, r;
		cin>>l>>r;
		l--;
		r--;
		auto it=segments.upper_bound({l,r});
		if(it!=segments.begin()){
			it--;
			int lx=it->first;
			int rx=it->second;
			if(lx<=l && r<=rx){
				cout<<1<<"\n";
			} else {
				cout<<0<<"\n";
			}
		}else{
			assert(false);
		}
	}
	return 0;
}

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