【数位DP】SPOJ 10606 BALNUM Balanced Numbers

点击打开链接

题意：每一个奇数出现偶数次，每一个偶数出现奇数次。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define cler(arr, val)    memset(arr, val, sizeof(arr))
#define FOR(i,a,b)  for(int i=a;i<=b;i++)
#define IN   freopen ("in.txt" , "r" , stdin);
#define OUT  freopen ("out.txt" , "w" , stdout);
typedef long long  LL;
const int MAXN = 1011;
const int MAXM = 610;
const int INF = 0x3f3f3f3f;
const LL mod = 2147483647;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1int len,dig[66];
int len,dig[66];
LL dp[20][66666];
bool check(int s)
{
    int num[10];
    for(int i=0;i<10;i++)
    {
        num[i]=s%3;
        s/=3;
    }
    for(int i=0;i<10;i++)
        if(num[i]!=0)
        {
            if(i%2==0 && num[i]==2)return false;
            if(i%2==1 && num[i]==1)return false;
        }
    return true;
}
int getnews(int x,int s)
{
    int num[10];
    for(int i=0;i<10;i++)
    {
        num[i]=s%3;
        s/=3;
    }
    if(num[x]==0)num[x]=1;
    else num[x]=3-num[x];
    int news=0;
    for(int i=9;i>=0;i--)
    {
        news*=3;
        news+=num[i];
    }
    return news;
}
LL dfs(int pos,int s,int flag,int limit)
{
    if(pos<0)
        return check(s);
    if(!limit&&dp[pos][s]!=-1)
        return dp[pos][s];
    LL res=0;
    int last=limit?dig[pos]:9;
    for(int i=0;i<=last;i++)
    {
        res+=dfs(pos-1,(flag&&i==0)?0:getnews(i,s),flag&&i==0,limit&&(i==last));
    }
    if(!limit)
        dp[pos][s]=res;
    return res;
}
LL solve(LL x)
{
    len=0;
    if(x==0)
    {
        dig[len++]=0;
    }
    while(x)
    {
        dig[len++]=x%10;
        x/=10;
    }
    return dfs(len-1,0,1,1);
}
int main()
{
    LL t,x,y;
    cin>>t;
    cler(dp,-1);
    while(t--)
    {
        cin>>x>>y;
        cout<<solve(y)-solve(x-1)<<endl;
    }
    return 0;
}