cf242 E

题意：

$n$ 个数 $a_i$,

两种询问

$1, l, r$ 查询 $[l, r]$ 的和

$2, l, r, x$ 将区间 $[l, r]$ 所有数异或 $x$

建立 $30$ 课线段树

第 $i$ 颗线段树维护所有 $a$ 二进制的第 $i$ 为上的数字 $0, 1$

异或操作分别以 $x$ 的二进制相应位异或相应线段树

可见只有当 $x$ 的二进制位为 $1$ 是操作有效

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>

using namespace std;

#define LL long long

#define gc getchar()
inline int read() {int x = ; char c = gc; while(c < '' || c > '') c = gc;
while(c >= '' && c <= '') x = x *  + c - '', c = gc; return x;}
inline LL read_LL() {LL x = ; char c = gc; while(c < '' || c > '') c = gc;
while(c >= '' && c <= '') x = x *  + c - '', c = gc; return x;}
#undef gc

const int N = 1e5 + ;

int Size[N << ];
int n, m, Ans;

#define lson jd << 1
#define rson jd << 1 | 1

struct Node {
    int W[N << ], F[N << ];

    void Push_down(int jd) {
        F[lson] ^= , F[rson] ^= ;
        W[lson] = Size[lson] - W[lson];
        W[rson] = Size[rson] - W[rson];
        F[jd] = ;
    }

    void Push_up(int jd) {
        W[jd] = W[lson] + W[rson];
    }

    void Sec_G(int l, int r, int jd, int x, int y) {
        if(x <= l && r <= y) {
            F[jd] ^= ;
            W[jd] = Size[jd] - W[jd];
            return ;
        }
        if(F[jd]) Push_down(jd);
        int mid = (l + r) >> ;
        if(x <= mid) Sec_G(l, mid, lson, x, y);
        if(y > mid ) Sec_G(mid + , r, rson, x, y);
        Push_up(jd);
    }

    void Sec_A(int l, int r, int jd, int x, int y) {
        if(x <= l && r <= y) {
            Ans += W[jd];
            return ;
        }
        if(F[jd]) Push_down(jd);
        int mid = (l + r) >> ;
        if(x <= mid) Sec_A(l, mid, lson, x, y);
        if(y > mid)  Sec_A(mid + , r, rson, x, y);
    }
} Tree[];

void Build_tree(int l, int r, int jd) {
    Size[jd] = r - l + ;
    if(l == r) {
        int x = read();
        for(int i = ; ( << i) <= x; i ++) {
            Tree[i + ].W[jd] = (bool) (( << i) & x);
        }
        return ;
    }
    int mid = (l + r) >> ;
    Build_tree(l, mid, lson), Build_tree(mid + , r, rson);
    for(int i = ; i <= ; i ++) {
        Tree[i].W[jd] = Tree[i].W[lson] + Tree[i].W[rson];
    }
}

int main() {
    n = read();
    Build_tree(, n, );
    m = read();
    for(; m; m --) {
        int opt = read(), l = read(), r = read();
        if(opt == ) {
            int x = read();
            for(int i = ; ( << i) <= x; i ++) {
                if((( << i) & x)) {
                    Tree[i + ].Sec_G(, n, , l, r);
                }
            }
        } else {
            LL Answer = ;
            for(int i = ; i <= ; i ++) {
                Ans = ;
                Tree[i].Sec_A(, n, , l, r);
                Answer += (1ll * Ans * (LL) pow(, i - ));
            }
            cout << Answer << "\n";
        }
    }

    return ;
}