Submission #1154469

#	Time	Username	Problem	Language	Result	Execution time	Memory
1154469		khangrl	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	202 ms	12740 KiB

sortbooks

#include<bits/stdc++.h>
#define ff first
#define ss second
#define int long long
using namespace std;
int n, q, a[100005], st[400005];
set <int> s[100005];
int consst(int pos, int l, int r){
	if(l==r){
		st[pos]=a[l];
		return a[l];
	}
	int mid=(l+r)/2;
	st[pos]=max(consst(pos*2+1, l, mid), consst(pos*2+2, mid+1, r));
	return st[pos];
}
int find(int pos, int l, int r, int lb, int rb){
	if(lb<=l and rb>=r){
		return st[pos];
	}
	if(r<lb or l>rb){
		return 0;
	}
	int mid=(l+r)/2;
	return max(find(pos*2+1, l, mid, lb, rb), find(pos*2+2, mid+1, r, lb, rb));
}
signed main(){
	cin>>n>>q;
	for(int i=0; i<n; i++){
		cin>>a[i];
		s[a[i]].insert(i);
	}
	consst(0, 0, n-1);
	while(q--){
		int a, b, k;
		cin>>a>>b>>k;
		int mx=find(0, 0, n-1, a-1, b-1);
		auto l=s[mx].lower_bound(a);
		int mn=find(0, 0, n-1, *l+1, b-1);
		if(k>=mx+mn){
			cout<<1<<endl;
		}
		else{
			cout<<0<<endl;
		}
	}
}

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