【ATC】:Digits Paradise in Hexadecimal 数位DP

传送门

题意

给你一个十六进制数，求这个范围内满足所有位置上的数字出现的种类正好满足$k$次的个数

分析

我一开始的想法是维护$f[i][j]$数组，状态压缩来记忆化搜索，后来发现数组开不下
然后知到的是，在种类相同的情况下，第$i$位下的答案是相通的，所以我们只要维护数字出现的种类次数即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = 7e4 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
ll f[N][20][2][2];
char str[N];
int a[N];
int n,k;

ll dfs(int num,int sta,bool pre,bool st){
	int cnt = __builtin_popcount(sta);
	if(cnt > k) return 0;
	if(!num) return cnt == k && pre;
	if(f[num][cnt][pre][st] != -1) return f[num][cnt][pre][st];
	ll ans = 0;
	int ed = st ? a[num] : 15;
	for(int i = 0;i <= ed;i++){
    	ans += dfs(num - 1,(!pre && i == 0) ? sta : sta | (1 << i),pre || (i != 0),st && (i == ed));
    	ans %= mod;
	}
    f[num][cnt][pre][st] = ans;
    return ans;
}


int main() {
	scanf("%s",str + 1);
	read(k);
	n = strlen(str + 1);
	memset(f,-1,sizeof f);
	reverse(str + 1,str + 1 + n);
	for(int i = 1;i <= n;i++){
		a[i] = isdigit(str[i]) ? str[i] - '0' : str[i] - 'A' + 10;
	}
	dl(dfs(n,0,0,1));
	return 0;
}