제출 #959895

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
959895		ezzzay	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	3075 ms	9380 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
vector<bool>ans;
int arr[N];
int st[4*N];
void build(int node, int L, int R){
	if(L==R){
		st[node]=arr[L];
		return;
	}
	int mid=(L+R)/2;
	build(node*2,L,mid);
	build(node*2+1,mid+1,R);
	st[node]=max(st[node*2+1],st[node*2]);
}
int find(int node, int L, int R, int l, int r){
	if(l<=L and R<=r)return st[node];
	if(l>R or r<L)return -1e9;
	int mid=(L+R)/2;
	return max(find(node*2,L,mid,l,r),find(node*2+1,mid+1,R,l,r));
}
signed main(){
	int n,q;
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	build(1,1,n);
	while(q--){
		int l,r,k;
		cin>>l>>r>>k;
		bool u=1;
		for(int i=l+1;i<=r;i++){
			int x=find(1,1,n,l,i-1);
			if(x<= arr[i])continue;
			if(x+arr[i]>k)u=0;
		}
		ans.pb(u);
	}
	for(auto a:ans)cout<<a<<endl;
}

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