牛客14269 Sum

链接

点击跳转

题解

就直接分位算就可以了嘛

但是开32棵线段树好像会超时

所以我用的树状数组

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 100010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
#define mod 1000000007ll
struct BIT
{
    ll bit[maxn], n;
    void init(int N){n=N;for(int i=1;i<=n;i++)bit[i]=0;}
    ll lowbit(ll x){return x&(-x);}
    void add(ll pos, ll v)
    {
        for(;pos<=n;pos+=lowbit(pos))bit[pos]+=v;
    }
    ll sum(ll pos)
    {
        ll ans(0);
        for(;pos;pos-=lowbit(pos))ans+=bit[pos];
        return ans;
    }
}bit[32];
ll n, a[maxn], p2[maxn];
int main()
{
    ll n=read(), m, i, j;
    p2[0]=1; rep(i,1,n)p2[i]=p2[i-1]*2%mod;
    rep(i,1,n)a[i]=read();
    rep(j,0,31)
    {
        bit[j].init(n);
        rep(i,1,n)
            bit[j].add(i,!!( a[i]&(1ll<<j) ));
    }
    m=read();
    while(m--)
    {
        ll type=read(), x=read(), y=read();
        if(type==1)
        {
            rep(j,0,31)
            {
                bit[j].add(x,-!!( a[x]&(1ll<<j) ));
                bit[j].add(x,!!( y&(1ll<<j) ));
            }
            a[x]=y;
        }
        else
        {
            ll ans=0;
            rep(j,0,31)
            {
                ll t = bit[j].sum(y)-bit[j].sum(x-1);
                ans += (p2[t]-1)*p2[j];
                // printf("j=%lld t=%lld %lld*%lld\n",j,t,(p2[t]-1),p2[j]);
            }
            printf("%lld\n",ans%mod);
        }
    }
    return 0;
}