Submission #532197

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const ll MOD = 1e9+7;
const int MAXN = 255;
ll dp[MAXN][MAXN][MAXN][2];
int N, X;
string S;

ll dfs(int n, int x, int renzoku, int f2) {
    if (x >= X) return 0;
    if (n >= N) return 1;
    ll& ret = dp[n][x][renzoku][f2];
    if (ret >= 0) return ret;
    ret = 0;
    if (isdigit(S[n])) {
        if (S[n] == '2') {
            if (f2) {
                ret += dfs(n+1, x, 0, 1);
            } else {
                ret += dfs(n+1, x, renzoku, 1);
            }
            ret %= MOD;
        } else if (S[n] == '5') {
            if (f2) {
                ret += dfs(n+1, x+renzoku+1, renzoku+1, 0);
            } else {
                ret += dfs(n+1, x, 0, 0);
            }
            ret %= MOD;
        } else {
            ret += dfs(n+1, x, 0, 0);
            ret %= MOD;
        }
    } else {
        for (int i = 0; i < 10; i++) {
            if (i == 2) {
                if (f2) {
                    ret += dfs(n+1, x, 0, 1);
                } else {
                    ret += dfs(n+1, x, renzoku, 1);
                }
                ret %= MOD;
            } else if (i == 5) {
                if (f2) {
                    ret += dfs(n+1, x+renzoku+1, renzoku+1, 0);
                } else {
                    ret += dfs(n+1, x, 0, 0);
                }
                ret %= MOD;
            } else {
                ret += dfs(n+1, x, 0, 0);
                ret %= MOD;
            }
        }
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> X;
    cin >> S;
    ll ans = 1;
    for (int i = 0; i < N; i++) if (S[i] == '?') (ans *= 10) %= MOD;
    memset(dp, -1, sizeof(dp));
    ans = (ans+MOD-dfs(0, 0, 0, 0))%MOD;
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result