计蒜客周赛第二场——凉菜鸡不会线段树

题意：https://nanti.jisuanke.com/t/38087?tdsourcetag=s_pcqq_aiomsg

思路：Trie解决XOR问题（这跟线段树有什么关系。。。）

            莫队暴力一发，好久不写trie了。。。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL maxn = 100000 + 100;
LL block;
struct piii{
    LL id,l,r;
    piii( LL ii ,LL ll,LL rr ){
        id = ii;
        l = ll;
        r = rr;
    }
    bool operator < ( const piii & b ) const {
        if( l/block == b.l/block ) return r < b.r;
        return l < b.l;
    }
};
vector< piii > query;
LL tot,ch[5 * maxn][21],ccnt[5*maxn], k,ans,Ans[maxn],a[maxn];
void init(){
    memset( ch,0,sizeof( ch ) );
    memset( ccnt,0,sizeof( ccnt ) );
    tot = 1;
    ans = 0;
}
void Insert( LL x,LL v ){
    LL p = 1;
    ccnt[1] += v;
    for( LL i = 20; i >= 0;i-- ){
        LL t = x >> i & (LL)1;
        if( !ch[p][t] ) ch[p][t] = ++tot;
        p = ch[p][t];
        ccnt[ p ] += v;
    }
}
LL ask( LL x ){
    LL p = 1;
    LL re = 0;
    for( LL i = 20;i >= 0;i-- ){
        LL v1 = x >> i & 1;
        LL v2 = k >> i & 1;
        if( v2 ){
            if( v1 ){
                p = ch[p][0];
                if( !p ) break;
            }else{
                p = ch[p][1];
                if( !p ) break;
            }
        }else{
            if( v1 ){
                if( ch[p][0] ) re += ccnt[ ch[p][0] ];
                p = ch[p][1];
                if( !p ) break;
            }else{
                if( ch[p][1] ) re += ccnt[ ch[p][1] ];
                p = ch[p][0];
                if( !p ) break;
            }
        }
    }
    return re;
}
void update( LL x,LL v ){
    ans += ask( x ) * v;
    Insert( x,v );
}
LL m;
void solve(){
    LL l = 1,r = 0;
    for( LL i = 0;i < m;i++ ){
        LL L = query[i].l;
        LL R = query[i].r;
        LL id = query[i].id;
        while( r < R ) update( a[++r],1 );
        while( l > L ) update( a[--l],1 );
        while( r > R ) update( a[r--],-1 );
        while( l < L ) update( a[l++],-1 );
        Ans[id] = ans;
    }
}
int main()
{
    init();
    LL n,l,r,x;
    scanf("%lld%lld%lld",&n,&m,&k);
    block = sqrt(n+1);
    a[0] = 0;
    for( LL i = 1;i <= n;i++ ) scanf("%lld",&x),a[i] = a[i-1] ^ x;
    for( LL i = 1; i <= m;i++ ){
        scanf("%lld%lld",&l,&r);
        query.push_back( piii( i,l-1,r ) );
    }
    sort( query.begin(),query.end() );
    solve();
    for( LL i = 1;i <= m;i++ ){
        printf("%lld\n",Ans[i]);
    }
    return 0;
}