Submission #338315

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define mp1(a,b,c) P1(a,P(b,c))
#define pque(a) priority_queue<a>
#define rpque(a) priority_queue<a,vector<a>,greater<a>>

const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
const int kaijou[10]={1,1,2,6,24,120,720,5040,40320,362880};

const ll M = 1000000007;

int main(){
	ll n,x;
	string s;
	
	cin >> n >> x >> s;
	
	ll dp[2][260][2][25] = {};
	ll t = 0,t_ = 1;
	dp[t][0][0][0] = 1;
	rep(i,n){
		char c = s[i];
		rep(j,260)rep(k,2)rep(l,25)dp[t_][j][k][l] = 0;
		if(c == '2' || c == '?'){
			rep(j,x){
				int k = 0;
					rep(l,23){
						dp[t_][j][1][l] += dp[t][j][k][l];
					}
				k = 1;
					rep(l,23){
						dp[t_][j][1][0] += dp[t][j][k][l];
					}
			}
		}
		if(c == '5' || c == '?'){
			rep(j,x){
				int k = 0;
					rep(l,23){
						dp[t_][j][0][0] += dp[t][j][k][l];
					}
				k = 1;
					rep(l,23){
						if(j+l+1 >= x)dp[t_][x][0][0] += dp[t][j][k][l];
						else dp[t_][j+l+1][0][l+1] += dp[t][j][k][l];
					}
			}
		}
		if(c == '?'){
			rep(j,x){
				rep(k,2){
					rep(l,23){
						dp[t_][j][0][0] += dp[t][j][k][l]*8;
					}
				}
			}
		}
		if(c != '2' && c != '5' && c != '?'){
			rep(j,x){
				rep(k,2){
					rep(l,23){
						dp[t_][j][0][0] += dp[t][j][k][l];
					}
				}
			}
		}
		if(c == '?')dp[t_][x][0][0] += dp[t][x][0][0]*10;
		else dp[t_][x][0][0] += dp[t][x][0][0];
		dp[t_][x][0][0] %= M;
		rep(j,x){
			rep(k,2){
				rep(l,23){
					dp[t_][j][k][l] %= M;
				}
			}
		}
		swap(t,t_);
	}
	
	cout << dp[t][x][0][0] << endl;
}

Submission Info

Judge Result