oj.uz

답안 #539337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
539337 2022-03-18T18:05:04 Z 1ne Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 393 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int64_t>extra;
void combine(vector<int64_t>tree1,vector<int64_t>tree2,int64_t node){
	/*for (auto x:tree1){
		cout<<x<<" ";
	}
	cout<<"     - > ";
	for (auto x:tree2){
		cout<<x<<" ";
	}
	cout<<'\n';
	*/
	extra[node] = max(extra[node*2],extra[node*2 + 1]);
	auto right = upper_bound(tree2.begin(),tree2.end(),tree1.back()) - tree2.begin();
	while(right>=0){
		if (tree2[right]>=tree1.back() || right>=(int)tree2.size()){
			--right;
		}
		else break;
	}
	if (right>=0){
		extra[node] = max(extra[node],tree1.back() + tree2[right]);
	}
	// if there is a element in right segment which is less than left maximum
}
pair<vector<int64_t>,int64_t> combine2(pair<vector<int64_t>,int64_t>tree11,pair<vector<int64_t>,int64_t>tree22){
	pair<vector<int64_t>,int64_t> ans;
	ans.second = max(tree11.second,tree22.second);
	vector<int64_t>tree1 = tree11.first;
	vector<int64_t>tree2 = tree22.first;
	auto right = upper_bound(tree2.begin(),tree2.end(),tree1.back()) - tree2.begin();
	while(right>=0){
		if (tree2[right]>=tree1.back()|| right>=(int)tree2.size()){
			--right;
		}
		else break;
	}
	if (right>=0){
		ans.second = max(ans.second,tree1.back() + tree2[right]);
	}
	merge(tree1.begin(),tree1.end(),tree2.begin(),tree2.end(),back_inserter(ans.first));
	return ans;
}
void build(vector<vector<int64_t>>&tree,vector<int64_t>&arr,int64_t node,int64_t node_low,int64_t node_high){
    if (node_low==node_high){
        tree[node].push_back(arr[node_low]);
    }
    else {
        int64_t mid  =(node_low+node_high)>>1;
        build(tree,arr,node*2,node_low,mid);
        build(tree,arr,node*2 + 1,mid+1,node_high);
        combine(tree[2*node],tree[node*2 + 1],node);
        merge(tree[2*node].begin(),tree[2*node].end(),tree[2*node + 1].begin(),tree[2*node + 1].end(),back_inserter(tree[node]));    
    }  
}
int64_t curans = 0;
int64_t maxxy = 0;
void query(vector<vector<int64_t>>&tree,int64_t node,int64_t node_low,int64_t node_high,int64_t query_low,int64_t query_high){
    if (query_high<node_low||query_low>node_high)return ;
    if (query_low<=node_low&&query_high>=node_high){
    	curans = max(curans,extra[node]);
    	auto right = lower_bound(tree[node].begin(),tree[node].end(),maxxy) - tree[node].begin();
		while(right>=0){
			if (tree[node][right]>=maxxy || right>=(int)tree[node].size()){
				--right;
			}
			else break;
		}
		if (right>=0){
			curans = max(curans,maxxy + tree[node][right]);
		}
	    maxxy = max(maxxy,tree[node].back());
	    return ;
    }
    int64_t mid = (node_low+node_high)>>1;
   	query(tree,node*2,node_low,mid,query_low,query_high);
   	query(tree,node*2 + 1,mid+1,node_high,query_low,query_high);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t n,m;cin>>n>>m;
vector<int64_t>arr(n);
for (int64_t i = 0;i<n;++i){
	cin>>arr[i];
}
vector<vector<int64_t>>tree(4*n);
extra.resize(4*n,0);
build(tree,arr,1,0,n-1);
for (int64_t i = 0;i<m;++i){
	int64_t l,r,k;cin>>l>>r>>k;
	--l,--r;
	curans = 0;
	maxxy = 0;
	query(tree,1,0,n-1,l,r);
	//cout<<curans<<" "<<maxxy<<'\n';
	if (curans>k){
		cout<<0<<'\n';
	}
	else cout<<1<<'\n';
}
return 0;}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 760 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 5 ms 2128 KB Output is correct
13 Correct 6 ms 2128 KB Output is correct
14 Correct 7 ms 2128 KB Output is correct
15 Correct 7 ms 2128 KB Output is correct
16 Correct 9 ms 2128 KB Output is correct
17 Correct 4 ms 1616 KB Output is correct
18 Correct 5 ms 2128 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 36760 KB Output is correct
2 Correct 129 ms 36824 KB Output is correct
3 Correct 136 ms 36764 KB Output is correct
4 Correct 126 ms 36760 KB Output is correct
5 Correct 134 ms 36776 KB Output is correct
6 Correct 99 ms 36688 KB Output is correct
7 Correct 118 ms 36508 KB Output is correct
8 Correct 111 ms 36568 KB Output is correct
9 Correct 26 ms 1872 KB Output is correct
10 Correct 115 ms 36512 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 5 ms 2128 KB Output is correct
13 Correct 6 ms 2128 KB Output is correct
14 Correct 7 ms 2128 KB Output is correct
15 Correct 7 ms 2128 KB Output is correct
16 Correct 9 ms 2128 KB Output is correct
17 Correct 4 ms 1616 KB Output is correct
18 Correct 5 ms 2128 KB Output is correct
19 Correct 357 ms 78056 KB Output is correct
20 Correct 364 ms 78216 KB Output is correct
21 Correct 299 ms 78100 KB Output is correct
22 Correct 276 ms 77956 KB Output is correct
23 Correct 319 ms 77916 KB Output is correct
24 Correct 250 ms 77960 KB Output is correct
25 Correct 265 ms 77812 KB Output is correct
26 Correct 310 ms 78212 KB Output is correct
27 Correct 284 ms 78228 KB Output is correct
28 Correct 334 ms 78032 KB Output is correct
29 Correct 318 ms 78096 KB Output is correct
30 Correct 369 ms 78084 KB Output is correct
31 Correct 320 ms 78192 KB Output is correct
32 Correct 309 ms 78216 KB Output is correct
33 Correct 393 ms 78276 KB Output is correct
34 Correct 222 ms 77728 KB Output is correct
35 Correct 230 ms 77704 KB Output is correct
36 Correct 232 ms 77704 KB Output is correct
37 Correct 243 ms 77704 KB Output is correct
38 Correct 237 ms 77704 KB Output is correct
39 Correct 317 ms 76692 KB Output is correct
40 Correct 205 ms 47332 KB Output is correct
41 Correct 299 ms 76420 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 5 ms 2128 KB Output is correct
13 Correct 6 ms 2128 KB Output is correct
14 Correct 7 ms 2128 KB Output is correct
15 Correct 7 ms 2128 KB Output is correct
16 Correct 9 ms 2128 KB Output is correct
17 Correct 4 ms 1616 KB Output is correct
18 Correct 5 ms 2128 KB Output is correct
19 Runtime error 370 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -