Codeforces #159 224 E E. XOR on Segment 二十几颗线段树 成段更新 成段求和

                                                                               E. XOR on Segment

You've got an array a, consisting of n integers a₁, a₂, ..., a_n. You are allowed to perform two operations on this array:

1. Calculate the sum of current array elements on the segment [l, r], that is, count value a_l + a_l + 1 + ... + a_r.
2. Apply the xor operation with a given number x to each array element on the segment[l, r], that is, execute . This operation changes exactlyr - l + 1 array elements.

Expression means applying bitwise xor operation to numbersx and y. The given operation exists in all modern programming languages, for example in languageC++ and Java it is marked as "^", inPascal — as "xor".

You've got a list of m operations of the indicated type. Your task is to perform all given operations, for each sum query you should print the result you get.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵) — the size of the array. The second line contains space-separated integersa₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁶) — the original array.

The third line contains integer m (1 ≤ m ≤ 5·10⁴) — the number of operations with the array. Thei-th of the following m lines first contains an integer t_i (1 ≤ t_i ≤ 2) — the type of thei-th query. If t_i = 1, then this is the query of the sum, ift_i = 2, then this is the query to change array elements. If thei-th operation is of type 1, then next follow two integers l_i, r_i (1 ≤ l_i ≤ r_i ≤ n). If the i-th operation is of type 2, then next follow three integers l_i, r_i, x_i (1 ≤ l_i ≤ r_i ≤ n, 1 ≤ x_i ≤ 10⁶). The numbers on the lines are separated by single spaces.

Output

For each query of type 1 print in a single line the sum of numbers on the given segment. Print the answers to the queries in the order in which the queries go in the input.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use thecin, cout streams, or the%I64d specifier.

Sample test(s)

Input

5
4 10 3 13 7
8
1 2 4
2 1 3 3
1 2 4
1 3 3
2 2 5 5
1 1 5
2 1 2 10
1 2 3

Output

26
22
0
34
11

Input

6
4 7 4 0 7 3
5
2 2 3 8
1 1 5
2 3 5 1
2 4 5 6
1 2 3

Output

38
28

一开始定义的res 为int 的导致WA了好几次。。。。。。。囧~~~

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100002;
int n,m,sum[maxn<<2][26];
__int64 res,col[maxn<<2];
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
void pushup(int rt)
{
    for(int i=0;i<=25;i++)
    {
        sum[rt][i]=sum[rt<<1][i]+sum[rt<<1|1][i];
    }
}
void pushdown(int rt,int l,int r)
{
    if(col[rt])
    {
        int mid=(l+r)>>1;
        col[rt<<1]^=col[rt];
        col[rt<<1|1]^=col[rt];
        for(int i=0;i<=25;i++)
        {
            if((col[rt]>>i)&1)
            {
              sum[rt<<1][i]=mid-l+1-sum[rt<<1][i];
              sum[rt<<1|1][i]=r-mid-sum[rt<<1|1][i];
            }
        }
        col[rt]=0;
    }
}
void build(int rt,int l,int r)
{
    int i;
    col[rt]=0;
    for(i=0;i<=25;i++)sum[rt][i]=0;
    if(l==r)
    {
        int num;
        scanf("%d",&num);
        for(i=0;i<=25;i++)
        {
            sum[rt][i]=((num>>i)&1);
        }
        return;
    }
    int mid=(l+r)>>1;
    build(lson);
    build(rson);
    pushup(rt);
}
void update(int rt,int l,int r,int L,int R,int x)
{
    if(L<=l&&r<=R)
    {
        col[rt]^=x;
        for(int i=0;i<=25;i++)
        {
            if((x>>i)&1)
            {
                sum[rt][i]=(r-l+1)-sum[rt][i];
            }
        }
        return;
    }
    pushdown(rt,l,r);
    int mid=(l+r)>>1;
    if(mid>=L) update(lson,L,R,x);
    if(mid<R)  update(rson,L,R,x);
    pushup(rt);
}
void query(int rt,int l,int r,int L,int R)
{
    if(L<=l&&r<=R)
    {
        for(int i=0;i<=25;i++)
        {
            res+=sum[rt][i]*((1LL)<<i);
        }
        return;
    }
    pushdown(rt,l,r);
    int mid=(l+r)>>1;
    if(mid>=L) query(lson,L,R);
    if(mid<R) query(rson,L,R);
    pushup(rt);
    return ;
}
int main()
{
    while(~scanf("%d",&n))
    {
        int t,l,r,x;
        build(1,1,n);
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d",&t);
            if(t==1)
            {
                scanf("%d%d",&l,&r);
                res=0;
                query(1,1,n,l,r);
                printf("%I64d\n",res);
            }else
            {
                scanf("%d%d%d",&l,&r,&x);
                update(1,1,n,l,r,x);
            }
        }
    }
    return 0;
}
/*
5
4 10 3 13 7
8
1 2 4
2 1 3 3
1 2 4
1 3 3
2 2 5 5
1 1 5
2 1 2 10
1 2 3

6
4 7 4 0 7 3
5
2 2 3 8
1 1 5
2 3 5 1
2 4 5 6
1 2 3
*/