Sum Of Digit

链接

点击跳转

题解

只要往线段树的方向想，这个题的做法就出来了

假设用线段树做的话，一定要解决“怎么合并”的问题

这个时候我猜了一个结论，把原来的数字砍成好几段，每一段分别$SOD$，然后合起来再$SOD$，答案不会变

我不会证，打了个表，发现没问题

然后写了一发，它就过了

代码

#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;
}
ll SOD[0xFF + 5];
#define mod 1000000007ll
#define base 1021ll
struct S
{
    ll v[16];
    S(){cl(v);}
    ll& operator[](ll index){return v[index];}
};
S operator+(S A, S B)
{
    ll i, j;
    S ret;
    rep(i,0x0,0xF)rep(j,0x0,0xF)
        ( ret[ SOD[(i<<4)+j] ] += A[i]*B[j] ) %= mod;
    rep(i,0x0,0xF)ret[i]+=A[i], ret[i]+=B[i], ret[i]%=mod;
    return ret;
}
char s[maxn];
struct SegmentTree
{
    ll L[maxn<<2], R[maxn<<2];
    S sum[maxn<<2];
    void pushup(ll o)
    {
        sum[o]=sum[o<<1]+sum[o<<1|1];
    }
    void build(ll o, ll l, ll r)
    {
        ll mid(l+r>>1);
        L[o]=l, R[o]=r;
        if(l==r)
        {
            sum[o] = *(new S);
            sum[o][s[l]] = 1;
            return;
        }
        build(o<<1,l,mid);
        build(o<<1|1,mid+1,r);
        pushup(o);
    }
    S Q(ll o, ll l, ll r)
    {
        ll mid(L[o]+R[o]>>1);
        S ans;
        if(l<=L[o] and r>=R[o])return sum[o];
        if(l<=mid)ans = ans + Q(o<<1,l,r);
        if(r>mid)ans = ans + Q(o<<1|1,l,r);
        return ans;
    }
    void chg(ll o, ll pos)
    {
        ll mid(L[o]+R[o]>>1);
        if(L[o]==R[o])
        {
            sum[o] = *(new S);
            sum[o][s[pos]] = 1;
            return;
        }
        if(pos<=mid)chg(o<<1,pos);
        else chg(o<<1|1,pos);
        pushup(o);
    }
}segtree;
ll index(char c)
{
    if(isdigit(c))return c-0x30;
    else return c-'A'+10;
}
int main()
{
    ll i, n=read(), q=read();
    rep(i,0x0,0xF)SOD[i]=i;
    rep(i,0xF+1,0xFF)SOD[i]=SOD[(i>>4)+(i&0xF)];
    scanf("%s",s+1);
    rep(i,1,n)s[i]=index(s[i]);
    segtree.build(1,1,n);
    while(q--)
    {
        ll type=read();
        if(type==1)
        {
            ll pos = read();
            char str[3];
            scanf("%s",str);
            s[pos] = index(*str);
            segtree.chg(1,pos);
        }
        else
        {
            ll l=read(), r=read();
            auto ret = segtree.Q(1,l,r);
            ll ans = 0, tmp=1;
            rep(i,0x0,0xF)
            {
                ans += tmp*ret[i];
                (tmp*=base)%=mod;
                ans %= mod;
            }
            printf("%lld\n",ans);
        }
    }
    return 0;
}