제출 #1336068

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1336068		sporknives	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	13 / 100	1896 ms	8432 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

signed main() {
	int n,q; cin>>n>>q;
	vector<int> a(n); for(int i=0;i<n;i++) cin>>a[i];
	vector<int> drops;
	for(int i=0;i<n-1;i++) {
		if(a[i]>a[i+1]) drops.push_back(i);
	}
	sort(drops.begin(),drops.end());
	for(int i=0;i<q;i++) {
		int l,r,k; cin>>l>>r>>k; l--; r--;
		auto lb = lower_bound(drops.begin(),drops.end(),l);
		if(lb==drops.end()) {
			cout<<"1\n";
			continue;
		}
		if((*lb) >= r) cout<<"1\n";
		else cout<<"0\n";
	}
	return 0;
}

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