Submission #343369
Source Code Expand
#include <algorithm> #include <cstdio> #include <cstdlib> #include <cctype> #include <cmath> #include <iostream> #include <queue> #include <list> #include <map> #include <numeric> #include <set> #include <sstream> #include <string> #include <vector> using namespace std; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; #define MOD 1000000007 int dp[255][10][255][255]; int main(){ int N, X; string str; cin >> N >> X; cin >> str; if(str[0] == '?'){ rep(i,10){ if(i==2){ dp[0][i][1][0] = 1; }else{ dp[0][i][0][0] = 1; } } }else{ int t = str[0]-'0'; if(t==2){ dp[0][t][1][0] = 1; }else{ dp[0][t][0][0] = 1; } } rep(i,N-1){ rep(j,10){ rep(k,N+1){ rep(l,X+2){ //cout << i << " " << j << " " << k << " " << l << " " << dp[i][j][k][l] << endl; if(str[i+1]=='?'){ rep(t,10){ if(t==2){ if(j==5){ dp[i+1][t][k+1][l] += dp[i][j][k][l]; dp[i+1][t][k+1][l] %= MOD; }else{ dp[i+1][t][1][l] += dp[i][j][k][l]; dp[i+1][t][1][l] %= MOD; } } else if(t==5){ if(j==2){ dp[i+1][t][k+1][min(X,l+(k+1)/2)] += dp[i][j][k][l]; dp[i+1][t][k+1][min(X,l+(k+1)/2)] %= MOD; }else{ dp[i+1][t][0][l] += dp[i][j][k][l]; dp[i+1][t][0][l] %= MOD; } } else{ dp[i+1][t][0][l] += dp[i][j][k][l]; dp[i+1][t][0][l] %= MOD; } } }else{ int t = str[i+1]-'0'; if(t==2){ if(j==5){ dp[i+1][t][k+1][l] += dp[i][j][k][l]; dp[i+1][t][k+1][l] %= MOD; }else{ dp[i+1][t][1][l] += dp[i][j][k][l]; dp[i+1][t][1][l] %= MOD; } } else if(t==5){ if(j==2){ dp[i+1][t][k+1][min(X,l+(k+1)/2)] += dp[i][j][k][l]; dp[i+1][t][k+1][min(X,l+(k+1)/2)] %= MOD; }else{ dp[i+1][t][0][l] += dp[i][j][k][l]; dp[i+1][t][0][l] %= MOD; } } else{ dp[i+1][t][0][l] += dp[i][j][k][l]; dp[i+1][t][0][l] %= MOD; } } } } } } int ret = 0; rep(i,10){ rep(j,N){ ret = (ret + dp[N-1][i][j][X])%MOD; } } cout << ret << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ニコニコ文字列2 |
User | phyllo |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 2985 Byte |
Status | WA |
Exec Time | 2054 ms |
Memory | 136172 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 25 ms | 920 KB |
sample_02.txt | AC | 31 ms | 1816 KB |
subtask1_01.txt | AC | 25 ms | 800 KB |
subtask1_02.txt | WA | 25 ms | 924 KB |
subtask1_03.txt | AC | 28 ms | 812 KB |
subtask1_04.txt | WA | 25 ms | 920 KB |
subtask1_05.txt | AC | 449 ms | 29672 KB |
subtask1_06.txt | AC | 622 ms | 28376 KB |
subtask1_07.txt | WA | 387 ms | 25200 KB |
subtask1_08.txt | WA | 680 ms | 12016 KB |
subtask1_09.txt | AC | 257 ms | 10344 KB |
subtask1_10.txt | WA | 86 ms | 4328 KB |
subtask1_11.txt | AC | 960 ms | 61420 KB |
subtask1_12.txt | TLE | 2042 ms | 23536 KB |
subtask1_13.txt | AC | 1029 ms | 94576 KB |
subtask1_14.txt | TLE | 2044 ms | 37100 KB |
subtask1_15.txt | TLE | 2046 ms | 37096 KB |
subtask1_16.txt | TLE | 2046 ms | 38116 KB |
subtask1_17.txt | TLE | 2040 ms | 25696 KB |
subtask1_18.txt | TLE | 2054 ms | 56692 KB |
subtask1_19.txt | TLE | 2041 ms | 25708 KB |
subtask1_20.txt | TLE | 2045 ms | 37736 KB |
subtask1_21.txt | WA | 973 ms | 136172 KB |
subtask1_22.txt | WA | 770 ms | 81124 KB |