HDU 5057 Argestes and Sequence --树状数组(卡内存)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 100003

unsigned short c[10][10][N];
bool f[10][10][N];
int n,m;
int a[N];
int ten[11] = {1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000};

int lowbit(int x) { return x&-x; }

void modify(int D,int P,int x,int val)
{
    while(x <= n)
    {
        c[D][P][x] += val;
        if(c[D][P][x] > 50000) c[D][P][x] -= 50000, f[D][P][x] = 1;
        x += lowbit(x);
    }
}

int getsum(int D,int P,int x)
{
    int res = 0;
    while(x > 0)
    {
        res += c[D][P][x];
        if(f[D][P][x]) res += 50000;
        x -= lowbit(x);
    }
    return res;
}

int main()
{
    int i,j,t;
    char ss[4];
    int x,y,L,R,D,P;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        memset(c,0,sizeof(c));
        memset(f,0,sizeof(f));
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            for(j=0;j<10;j++)
            {
                int num = a[i]/ten[j];
                num %= 10;
                modify(j,num,i,1);
            }
        }
        while(m--)
        {
            scanf("%s",ss);
            if(ss[0] == ‘Q‘)
            {
                scanf("%d%d%d%d",&L,&R,&D,&P);
                D--;
                printf("%d\n",getsum(D,P,R) - getsum(D,P,L-1));
            }
            else
            {
                scanf("%d%d",&x,&y);
                for(i=0;i<10;i++)
                {
                    int num = a[x]/ten[i];
                    num %= 10;
                    modify(i,num,x,-1);
                }
                for(i=0;i<10;i++)
                {
                    int num = y/ten[i];
                    num %= 10;
                    modify(i,num,x,1);
                }
                a[x] = y;
            }
        }
    }
    return 0;
}