Submission #338060
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------
int N,X;
ll mo=1000000007;
string S;
ll dp[303][303][303];
ll madd(ll& a,ll b){ (a+=b)%=mo;}
void solve() {
int i,j,k,l,r,x,y,z; string s;
cin>>N>>X>>S;
dp[0][0][0]=1;
FOR(i,N) {
FOR(y,255) FOR(z,300) if(dp[i][y][z]) {
ll d=dp[i][y][z];
if(S[i]=='?') {
if(y%2==0) madd(dp[i+1][y+1][z],d);
else madd(dp[i+1][1][z],d);
if(y%2==1) madd(dp[i+1][y+1][min(X,z+(y+1)/2)],d);
else madd(dp[i+1][0][z],d);
madd(dp[i+1][0][z],8*d);
}
else if(S[i]=='2') {
if(y%2==0) madd(dp[i+1][y+1][z],d);
else madd(dp[i+1][1][z],d);
}
else if(S[i]=='5') {
if(y%2==1) madd(dp[i+1][y+1][min(X,z+(y+1)/2)],d);
else madd(dp[i+1][0][z],d);
}
else {
madd(dp[i+1][0][z],d);
}
}
}
ll ret=0;
FOR(y,257) ret += dp[N][y][X];
cout<<ret%mo<<endl;
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false);
FOR(i,argc-1) s+=argv[i+1],s+='\n';
FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
solve(); return 0;
}
Submission Info
Submission Time |
|
Task |
A - ニコニコ文字列2 |
User |
kmjp |
Language |
C++ (G++ 4.6.4) |
Score |
20 |
Code Size |
1480 Byte |
Status |
AC |
Exec Time |
457 ms |
Memory |
78152 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
20 / 20 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
All |
subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
46 ms |
1264 KB |
sample_02.txt |
AC |
42 ms |
1480 KB |
subtask1_01.txt |
AC |
33 ms |
1264 KB |
subtask1_02.txt |
AC |
35 ms |
1260 KB |
subtask1_03.txt |
AC |
33 ms |
1256 KB |
subtask1_04.txt |
AC |
34 ms |
1260 KB |
subtask1_05.txt |
AC |
186 ms |
2248 KB |
subtask1_06.txt |
AC |
114 ms |
2292 KB |
subtask1_07.txt |
AC |
131 ms |
10548 KB |
subtask1_08.txt |
AC |
87 ms |
6444 KB |
subtask1_09.txt |
AC |
74 ms |
4024 KB |
subtask1_10.txt |
AC |
59 ms |
2744 KB |
subtask1_11.txt |
AC |
179 ms |
2612 KB |
subtask1_12.txt |
AC |
182 ms |
2748 KB |
subtask1_13.txt |
AC |
181 ms |
3660 KB |
subtask1_14.txt |
AC |
182 ms |
3508 KB |
subtask1_15.txt |
AC |
278 ms |
32480 KB |
subtask1_16.txt |
AC |
258 ms |
29896 KB |
subtask1_17.txt |
AC |
457 ms |
78152 KB |
subtask1_18.txt |
AC |
181 ms |
2252 KB |
subtask1_19.txt |
AC |
330 ms |
37576 KB |
subtask1_20.txt |
AC |
257 ms |
31156 KB |
subtask1_21.txt |
AC |
367 ms |
77640 KB |
subtask1_22.txt |
AC |
230 ms |
22980 KB |