Submission #3923405
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <map> #include <queue> #include <bitset> #include <set> #include <cmath> using namespace std; #define MOD 1000000007 long long dp[303][303][303]; void add(long long &a, long long x){ a = (a + x) % MOD; } int main(){ int N, K; string S; cin >> N >> K >> S; dp[0][0][0] = 1; for(int i=0; i<N; i++){ for(int j=0; j<=K; j++){ for(int k=0; k<=K; k++){ if(S[i]=='1') add(dp[i+1][j+1][max(0, k-1)], dp[i][j][k]); if(S[i]=='0') add(dp[i+1][max(0, j-1)][k+1], dp[i][j][k]); if(S[i]=='?'){ add(dp[i+1][j+1][max(0, k-1)], dp[i][j][k]); add(dp[i+1][max(0, j-1)][k+1], dp[i][j][k]); } } } } long long ans = 0; for(int j=0; j<=K; j++) for(int k=0; k<=K; k++) add(ans, dp[N][j][k]); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 偶然ジェネレータ |
User | suzume |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1023 Byte |
Status | AC |
Exec Time | 229 ms |
Memory | 216576 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 10 / 10 | 30 / 30 | 60 / 60 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask0-sample-04.txt |
Subtask1 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask0-sample-04.txt, 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 |
Subtask2 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask0-sample-04.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt |
Subtask3 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask0-sample-03.txt, subtask0-sample-04.txt, 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, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask3-01.txt, subtask3-02.txt, subtask3-03.txt, subtask3-04.txt, subtask3-05.txt, subtask3-06.txt, subtask3-07.txt, subtask3-08.txt, subtask3-09.txt, subtask3-10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample-01.txt | AC | 3 ms | 6400 KB |
subtask0-sample-02.txt | AC | 3 ms | 6400 KB |
subtask0-sample-03.txt | AC | 3 ms | 6400 KB |
subtask0-sample-04.txt | AC | 3 ms | 8448 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | AC | 2 ms | 2304 KB |
subtask1-03.txt | AC | 3 ms | 6400 KB |
subtask1-04.txt | AC | 3 ms | 8448 KB |
subtask1-05.txt | AC | 3 ms | 8448 KB |
subtask1-06.txt | AC | 3 ms | 8448 KB |
subtask1-07.txt | AC | 3 ms | 8448 KB |
subtask1-08.txt | AC | 3 ms | 8448 KB |
subtask1-09.txt | AC | 3 ms | 8448 KB |
subtask1-10.txt | AC | 3 ms | 8448 KB |
subtask2-01.txt | AC | 20 ms | 86272 KB |
subtask2-02.txt | AC | 29 ms | 129280 KB |
subtask2-03.txt | AC | 46 ms | 215296 KB |
subtask2-04.txt | AC | 46 ms | 215424 KB |
subtask2-05.txt | AC | 46 ms | 215296 KB |
subtask2-06.txt | AC | 46 ms | 215296 KB |
subtask2-07.txt | AC | 46 ms | 215296 KB |
subtask2-08.txt | AC | 46 ms | 215296 KB |
subtask2-09.txt | AC | 46 ms | 215296 KB |
subtask2-10.txt | AC | 46 ms | 215296 KB |
subtask3-01.txt | AC | 40 ms | 178560 KB |
subtask3-02.txt | AC | 49 ms | 215424 KB |
subtask3-03.txt | AC | 46 ms | 215296 KB |
subtask3-04.txt | AC | 47 ms | 215424 KB |
subtask3-05.txt | AC | 48 ms | 215424 KB |
subtask3-06.txt | AC | 49 ms | 215424 KB |
subtask3-07.txt | AC | 229 ms | 216576 KB |
subtask3-08.txt | AC | 46 ms | 215296 KB |
subtask3-09.txt | AC | 46 ms | 215296 KB |
subtask3-10.txt | AC | 47 ms | 215424 KB |