제출 #336632

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
336632		Gurban	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	1808 ms	67820 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn=1e6+5;
int n,m,l,r,k[maxn],w[maxn],T[4*maxn];
int ans[maxn];
vector<pair<int,int>>qr[maxn];
stack<pair<int,int>>s;

void upd(int pos,int val,int l,int r,int nd){
	if(l == r){
		T[nd] = max(T[nd],val);
		return;
	}
	if(pos <= (l+r)/2) upd(pos,val,l,(l+r)/2,nd*2);
	else upd(pos,val,(l+r)/2+1,r,nd*2+1);
	T[nd] = max(T[nd*2],T[nd*2+1]);
}

int tap(int a,int b,int l,int r,int nd){
	if(r < a or l > b) return 0;
	if(l >= a and r <= b) return T[nd];
	return max(tap(a,b,l,(l+r)/2,nd*2),tap(a,b,(l+r)/2+1,r,nd*2+1));
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for(int i = 1;i <= n;i++) cin >> w[i];
	for(int i = 1;i <= m;i++){
		cin >> l >> r >> k[i];
		qr[r].push_back({l,i});
	}
	for(int i = 1;i <= n;i++){
		while(!s.empty() and s.top().first <= w[i]) s.pop();
		if(!s.empty()){
			upd(s.top().second,s.top().first+w[i],1,n,1);
		}
		s.push({w[i],i});
		for(auto j : qr[i]){
			int jog = tap(j.first,i,1,n,1);
			if(jog <= k[j.second]) ans[j.second]=1;
		}
	}
	for(int i = 1;i <= m;i++) cout<<ans[i]<<'\n';
}

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