oj.uz

답안 #1111641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1111641 2024-11-12T12:44:12 Z nikolashami Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 2126 ms 238664 KB 
#include <bits/stdc++.h>
using namespace std;

const int N=1e6+4;
vector<int>st[4*N];
int mx[4*N],a[N],cur,ans,n,q;

void build(int node=1,int tl=0,int tr=n-1){
	if(tl==tr){
		mx[node]=0;
		st[node]={a[tr]};
		return;
	}
	int mid=(tl+tr)/2;
	build(node*2,tl,mid);
	build(node*2+1,mid+1,tr);
	st[node].resize((int)st[node*2].size()+(int)st[node*2+1].size());
	merge(st[node*2].begin(),st[node*2].end(),st[node*2+1].begin(),st[node*2+1].end(),st[node].begin());
	mx[node]=max(mx[node*2],mx[node*2+1]);
	int levi=st[node*2].back();
	auto it=upper_bound(st[node*2+1].begin(),st[node*2+1].end(),levi-1);
	if(it!=st[node*2+1].begin())
		it=prev(it);
	if(*it<levi)
		mx[node]=max(mx[node],*it+levi);
}

void qry(int l,int r,int node=1,int tl=0,int tr=n-1){
	if(tl>=l&&tr<=r){
		ans=max(ans,mx[node]);
		auto it=upper_bound(st[node].begin(),st[node].end(),cur-1);
		if(it!=st[node].begin())
			it=prev(it);
		if(*it<cur)
			ans=max(ans,*it+cur);
		cur=max(cur,st[node].back());
		return;
	}
	int mid=(tl+tr)/2;
	if(mid>=l)qry(l,r,2*node,tl,mid);
	if(mid<=r-1)qry(l,r,2*node+1,mid+1,tr);
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin>>n>>q;
    for(int i=0;i<n;++i)
    	cin>>a[i];

    build();

    while(q--){
    	int l,r,k;
    	cin>>l>>r>>k;
    	cur=0,ans=0;
    	qry(l,r);
    	cout<<(ans<=k)<<'\n';
    }
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 95304 KB Output is correct
2 Runtime error 176 ms 192844 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 95304 KB Output is correct
2 Runtime error 176 ms 192844 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2126 ms 238664 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 238 ms 219208 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 95304 KB Output is correct
2 Runtime error 176 ms 192844 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 95304 KB Output is correct
2 Runtime error 176 ms 192844 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -