#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]));
}
}
pair<vector<int64_t>,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},0};
if (query_low<=node_low&&query_high>=node_high){
return {tree[node],extra[node]};
}
int64_t mid = (node_low+node_high)>>1;
return combine2(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;
auto ans = query(tree,1,0,n-1,l,r);
//cout<<ans.second<<'\n';
if (ans.second>k){
cout<<0<<'\n';
}
else cout<<1<<'\n';
}
return 0;}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
3 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
3 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
406 ms |
262144 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3065 ms |
38040 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
3 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Incorrect |
3 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
