AtCoder abc194_f Digits Paradise in Hexadecimal(数位dp + 状压)

题目地址

题意:

给你一个16进制数n,要求你$[1,n]$ 中出现k个不同digits的数。

思路：

1. 数位dp
2. 题目的n很大，所以要先压缩状态。

学习：

这里介绍(统计一个数在二进制下有多少个1)

__builtin_popcount()

学习地址

AC

#include <iostream>
#include <bits/stdc++.h>
#define For(i,x,y) for(int i = (x);  i <= (y); i ++ )
#define fori(i,x,y) for(int i = (x); i < (y); i ++ )
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define endl '\n'
#define all(x) a.begin(), a.end()
#define mst(x,a) memset(x, a, sizeof x)
#define debug(a) cout<< #a <<": " << a << endl
using namespace std;

typedef long long LL;
typedef pair<int,int>pa;

const int inf = 0x3f3f3f3f;
const int INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9+7;
const int maxn = 2e5+10;
const int maxm = 1e6+10;
const int N = 1e6+10;

int dp[maxn][20][2][2];
int a[maxn], n, k;
int dfs(int x, int sta, bool lead = true, bool limit = true){
    int cnt = __builtin_popcount(sta);
    int& ans  = dp[x][cnt][lead][limit];
    if(~ans) return ans;
    if(cnt > k) return ans = 0;
    if(x==n) return cnt==k;
    int up = limit?a[x]:15;
    ans = 0;
    For(i,0,up){
        int add = dfs(x+1, (lead&&!i) ? sta : sta|1<<i, !i&&lead, limit && i == up);
        ans = (LL)ans + add;
        if(ans >= mod) ans -= mod;
    }
    return ans;
}
int main()
{
    ios::sync_with_stdio(0);
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
#endif
    string s;
    cin>>s>>k;
    mst(dp,-1);
    n = sz(s);
    fori(i,0,n)a[i] = isdigit(s[i])?s[i]-'0':s[i]-'A'+10;
    printf("%d\n", dfs(0,0));
    return 0;
}