fork download

copy

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n = 10004;
vector<int> tree[4*n+1];
class segmentTree{
 
public:
   //int n;
 
    void build(int arr[],int s, int e, int node){
        if(s==e){
            tree[node].push_back(arr[s]);
            return;
        }
        int mid = (s+e)/2;
        build(arr,s,mid,2*node);
        build(arr,s,mid,2*node+1);
        merge(tree[2*node].begin(),tree[2*node].end(),tree[2*node+1].begin(),tree[2*node].end(),back_inserter(tree[node]));
    }
    int query(int ss, int se, int l, int r, int k, int node){
        if(l>se || r<ss){
            return 0;
        }
        if(ss>=l && se<=r){
            return tree[node].size()-(upper_bound(tree[node].begin(),tree[node].end,k)-tree[node].begin());
        }
        int mid = (ss+se)/2;
        int left = query(ss,mid,l,r,k,2*node);
        int right = query(mid+1,se,l,r,k,2*node+1);
        return left+right;
    }
};
int main(){
    segmentTree t;
    int n;
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    t.build(arr,0,n-1,1);
    cin>>q;
    int ans = 0;
    while(q--){
        int i,j,k,l,r;
        cin>>i>>j>>k;
        l=i^ans;
        r=j^ans;
        k=k^ans;
        ans = t.query(0,n-1,l,r,k,1);
        cout<<ans<<endl;
    }
 
return 0;
}

prog.cpp:6:23: error: array bound is not an integer constant before ‘]’ token
 vector<int> tree[4*n+1];
                       ^
prog.cpp: In member function ‘void segmentTree::build(int*, int, int, int)’:
prog.cpp:14:13: error: ‘tree’ was not declared in this scope
             tree[node].push_back(arr[s]);
             ^~~~
prog.cpp:14:13: note: suggested alternative: ‘free’
             tree[node].push_back(arr[s]);
             ^~~~
             free
prog.cpp:20:15: error: ‘tree’ was not declared in this scope
         merge(tree[2*node].begin(),tree[2*node].end(),tree[2*node+1].begin(),tree[2*node].end(),back_inserter(tree[node]));
               ^~~~
prog.cpp:20:15: note: suggested alternative: ‘free’
         merge(tree[2*node].begin(),tree[2*node].end(),tree[2*node+1].begin(),tree[2*node].end(),back_inserter(tree[node]));
               ^~~~
               free
prog.cpp: In member function ‘int segmentTree::query(int, int, int, int, int, int)’:
prog.cpp:27:20: error: ‘tree’ was not declared in this scope
             return tree[node].size()-(upper_bound(tree[node].begin(),tree[node].end,k)-tree[node].begin());
                    ^~~~
prog.cpp:27:20: note: suggested alternative: ‘free’
             return tree[node].size()-(upper_bound(tree[node].begin(),tree[node].end,k)-tree[node].begin());
                    ^~~~
                    free
prog.cpp: In function ‘int main()’:
prog.cpp:44:10: error: ‘q’ was not declared in this scope
     cin>>q;
          ^

Standard output is empty