XOR on Segment(异或运算区间和+线段树)

题目链接

XOR on Segmenthttps://codeforces.com/contest/242/problem/E

思路

如果对于异或操作不同于加法和乘操作，每个数的变化方式不同，无法用基础的线段树去维护，考虑到异或操作每一位之间的操作没有关联性，我们将每一个节点的sum值拆分成二进制数，并且维护二进制数的每一位即可进行快速区间修改，并用相同的操作去pushup 二进制sum数组和pushdown lazytag

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define endl '\n'
#define lowbit(x) x &(-x)
#define mh(x) memset(x, -1, sizeof h)
#define debug(x) cerr << #x << "=" << x << endl;
const int N = 1e5 + 10;
const int mod = 998244353;
const double esp = 1e-6;
const double pi = acos(-1);
int read()
{
    int x = 0, f = 1;
    char c = getchar();
    while (c < '0' || c > '9')
    {
        if (c == '-')
            f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9')
        x = x * 10 + c - '0', c = getchar();
    return x * f;
}
void write(int x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
}
int a[N];
struct node
{
    int l, r;
    int sum[21];
    int tag;
} t[N << 2];
void pushup(int p)
{
    for (int i = 0; i <= 20; i++)
    {
        t[p].sum[i] = t[p << 1].sum[i] + t[p << 1 | 1].sum[i];
    }
}
void build(int p, int l, int r)
{
    t[p] = {l, r, {0}, 0};
    if (l == r)
    {
        for (int i = 0; i <= 20; i++)
            if (a[l] >> i & 1)
                t[p].sum[i]++;
        return;
    }
    int mid = l + r >> 1;
    build(p << 1, l, mid);
    build(p << 1 | 1, mid + 1, r);
    pushup(p);
}
void pushdown(int p)
{
    if (t[p].tag)
    {
        for (int i = 0; i <= 20; i++)
        {
            if (t[p].tag >> i & 1)
            {
                t[p << 1].sum[i] = (t[p << 1].r - t[p << 1].l + 1) - t[p << 1].sum[i];
                t[p << 1 | 1].sum[i] = (t[p << 1 | 1].r - t[p << 1 | 1].l + 1) - t[p << 1 | 1].sum[i];
            }
        }
        t[p << 1].tag ^= t[p].tag;
        t[p << 1 | 1].tag ^= t[p].tag;
        t[p].tag = 0;
    }
}
void modify(int p, int l, int r, int x)
{
    if (t[p].l >= l && t[p].r <= r)
    {
        for (int i = 0; i <= 20; i++)
        {
            if (x >> i & 1)
                t[p].sum[i] = (t[p].r - t[p].l + 1) - t[p].sum[i];
        }
        t[p].tag ^= x;
        return;
    }
    pushdown(p);
    if (t[p << 1].r >= l)
        modify(p << 1, l, r, x);
    if (t[p << 1 | 1].l <= r)
        modify(p << 1 | 1, l, r, x);
    pushup(p);
}
int query(int p, int l, int r)
{
    int res = 0;
    if (t[p].l >= l && t[p].r <= r)
    {
        for (int i = 0; i <= 20; i++)
            if (t[p].sum[i])
                res += (1 << i) * t[p].sum[i];
        return res;
    }
    pushdown(p);
    if (t[p << 1].r >= l)
        res = (res + query(p << 1, l, r));
    if (t[p << 1 | 1].l <= r)
        res = (res + query(p << 1 | 1, l, r));
    return res;
}
signed main()
{
    cin.tie(0)->sync_with_stdio(false);
    int n;
    n = read();
    for (int i = 1; i <= n; i++)
        a[i] = read();
    build(1, 1, n);
    int q;
    q = read();
    while (q--)
    {
        int op;
        op = read();
        if (op == 1)
        {
            int l, r;
            l = read(), r = read();
            write(query(1, l, r));
            puts("");
        }
        else if (op == 2)
        {
            int l, r, x;
            l = read(), r = read(), x = read();
            modify(1, l, r, x);
        }
    }
    return 0;
}