Submission #337880
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];
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) {
if(S[i]=='?') {
FOR(y,255) FOR(z,300) if(dp[i][y][z]) {
if(y%2==0) {
dp[i+1][y+1][z] += dp[i][y][z];
dp[i+1][y+1][z] %= mo;
}
else {
dp[i+1][1][z] += dp[i][y][z];
dp[i+1][1][z] %= mo;
}
if(y%2==1) {
dp[i+1][y+1][min(X,z+(y+1)/2)] += dp[i][y][z];
dp[i+1][y+1][min(X,z+(y+1)/2)] %= mo;
}
else {
dp[i+1][0][z] += dp[i][y][z];
dp[i+1][0][z] %= mo;
}
dp[i+1][0][z] += 8*dp[i][y][z];
dp[i+1][0][z] %= mo;
}
}
else if(S[i]=='2') {
FOR(y,255) FOR(z,300) if(dp[i][y][z]) {
if(y%2==0) {
dp[i+1][y+1][z] += dp[i][y][z];
dp[i+1][y+1][z] %= mo;
}
else {
dp[i+1][1][z] += dp[i][y][z];
dp[i+1][1][z] %= mo;
}
}
}
else if(S[i]=='5') {
FOR(y,255) FOR(z,300) if(dp[i][y][z]) {
if(y%2==1) {
dp[i+1][y+1][min(X,z+(y+1)/2)] += dp[i][y][z];
dp[i+1][y+1][min(X,z+(y+1)/2)] %= mo;
}
else {
dp[i+1][0][z] += dp[i][y][z];
dp[i+1][0][z] %= mo;
}
}
}
else {
FOR(y,255) FOR(z,300) {
dp[i+1][0][z] += dp[i][y][z];
dp[i+1][0][z] %= mo;
}
}
}
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 |
2034 Byte |
Status |
AC |
Exec Time |
327 ms |
Memory |
77680 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 |
24 ms |
920 KB |
sample_02.txt |
AC |
32 ms |
1068 KB |
subtask1_01.txt |
AC |
25 ms |
804 KB |
subtask1_02.txt |
AC |
24 ms |
932 KB |
subtask1_03.txt |
AC |
24 ms |
732 KB |
subtask1_04.txt |
AC |
24 ms |
924 KB |
subtask1_05.txt |
AC |
203 ms |
1960 KB |
subtask1_06.txt |
AC |
95 ms |
1828 KB |
subtask1_07.txt |
AC |
98 ms |
10100 KB |
subtask1_08.txt |
AC |
71 ms |
6032 KB |
subtask1_09.txt |
AC |
61 ms |
3492 KB |
subtask1_10.txt |
AC |
45 ms |
2344 KB |
subtask1_11.txt |
AC |
265 ms |
2476 KB |
subtask1_12.txt |
AC |
260 ms |
2604 KB |
subtask1_13.txt |
AC |
153 ms |
3236 KB |
subtask1_14.txt |
AC |
153 ms |
2984 KB |
subtask1_15.txt |
AC |
193 ms |
32048 KB |
subtask1_16.txt |
AC |
190 ms |
29428 KB |
subtask1_17.txt |
AC |
327 ms |
77680 KB |
subtask1_18.txt |
AC |
144 ms |
1712 KB |
subtask1_19.txt |
AC |
260 ms |
37020 KB |
subtask1_20.txt |
AC |
193 ms |
30808 KB |
subtask1_21.txt |
AC |
250 ms |
77224 KB |
subtask1_22.txt |
AC |
176 ms |
22556 KB |