lightoj-1122 - Digit Count dp

1122 - Digit Count

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

Given a set of digits S, and an integer n, you have to find how many n-digit integers are there, which contain digits that belong to S and the difference between any two adjacent digits is not more than two.

Input

Input starts with an integer T (≤ 300), denoting the number of test cases.

Each case contains two integers, m (1 ≤ m < 10) and n (1 ≤ n ≤ 10). The next line will contain m integers (from 1 to 9) separated by spaces. These integers form the set S as described above. These integers will be distinct and given in ascending order.

Output

For each case, print the case number and the number of valid n-digit integers in a single line.

Sample Input	Output for Sample Input
3 3 2 1 3 6 3 2 1 2 3 3 3 1 4 6	Case 1: 5 Case 2: 9 Case 3: 9

Note

For the first case the valid integers are

11

13

31

33

66

数位dp，设a[k]为读入的m个数字，dp[i][j]为i位数，最右边的数字为j，有

dp[i][j] = dp[i-1][j-2] + dp[i-1][j-1] + dp[i-1][j] + dp[i-1][j+1] + dp[i-1][j+2];

注意初始化边界以及j只能取a[k]。

#include <bits/stdc++.h>
//#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

#define ll long long
#define SZ(x) ((int)(x).size()) 
#define ALL(v) (v).begin(), (v).end()
#define foreach(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)
#define reveach(i, v) for (__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++ i) 
#define REP(i,a,n) for ( int i=a; i<int(n); i++ )
#define FOR(i,a,n) for ( int i=n-1; i>= int(a);i-- )
#define lson rt<<1, L, m
#define rson rt<<1|1, m, R
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define fi first
#define se second
#define CLR(a, b) memset(a, b, sizeof(a))
#define Min(a, b) a = min(a, b)
#define Max(a, b) a = max(a, b)
const int maxn = 10 + 7;
int T;
int kase;
int n, m;
int a[maxn];
ll dp[maxn][maxn];

ll solve(){
    ll res = 0;
    CLR(dp, 0);
    REP(j, 0, m) dp[0][a[j]] ++;
    REP(i, 1, n){
        REP(j, 0, m){
            REP(k, a[j] - 2, a[j] + 3) dp[i][a[j]] += dp[i-1][k];
        }
    }
    REP(j, 0, 10) res += dp[n-1][j];
    return res;
}
int main(){
#ifdef ac
    freopen("in.txt","r",stdin);
#endif
    //freopen("out.txt","w",stdout);
    scanf("%d", &T);
    while(T--){
        scanf("%d%d", &m, &n);
        REP(i, 0, m) scanf("%d", &a[i]);
        printf("Case %d: %lld\n", ++kase, solve());
    }
    return 0;
}