Submission #537678

#	Time	Username	Problem	Language	Result	Execution time	Memory
537678		1ne	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	422 ms	262144 KiB

sortbooks

#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 || right>=tree2.size()){
		if (tree2[right]>=tree1.back()){
			--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
}
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 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 0;
    if (query_low<=node_low&&query_high>=node_high){
    	//cout<<node_low<<" "<<node_high<<" "<<extra[node]<<'\n';
	    return extra[node];
    }
    int64_t mid = (node_low+node_high)>>1;
    return max(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;
	int64_t ans = query(tree,1,0,n-1,l,r);
	//cout<<ans<<'\n';
	if (ans>k){
		cout<<0<<'\n';
	}
	else cout<<1<<'\n';
}
return 0;}

Compilation message (stderr)

sortbooks.cpp: In function 'void combine(std::vector<long int>, std::vector<long int>, int64_t)':
sortbooks.cpp:16:25: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  while(right>=0 || right>=tree2.size()){
      |                    ~~~~~^~~~~~~~~~~~~~

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