Submission #1058918

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
 
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;
 
int mod = 1e9 + 7;
 
int main() {
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
 
  vvi dp(601, vi(601, 0)); // i番目まで、suffixのminがjでmaxがlであるパターンの数
  dp[300][300] = 1;
  rep (i, n) {
    vvi tmp(601, vi(601, 0));
    switch (s[i]) {
    case '0':
      FOR (j, 300-k, 301+k) {
        FOR (l, j, 301+k) {
          if (l+1 <= 300+k) {
            tmp[min(301, j+1)][max(301, l+1)] += dp[j][l];
            tmp[min(301, j+1)][max(301, l+1)] %= mod;
          }
        }
      }
      dp = tmp;
      break;
    case '1':
      FOR (j, 300-k, 301+k) {
        FOR (l, j, 301+k) {
          if (j-1 >= 300-k) {
            tmp[min(299, j-1)][max(299, l-1)] += dp[j][l];
            tmp[min(299, j-1)][max(299, l-1)] %= mod;
          }
        }
      }
      dp = tmp;
      break;
    case '?':
      FOR (j, 300-k, 301+k) {
        FOR (l, j, 301+k) {
          if (l+1 <= 300+k) {
            tmp[min(301, j+1)][max(301, l+1)] += dp[j][l];
            tmp[min(301, j+1)][max(301, l+1)] %= mod;
          }
          if (j-1 >= 300-k) {
            tmp[min(299, j-1)][max(299, l-1)] += dp[j][l];
            tmp[min(299, j-1)][max(299, l-1)] %= mod;
          }
        }
      }
      dp = tmp;
      break;
    }
  }
  int ans = 0;
  FOR (j, 300-k, 301+k) {
    FOR (l, j, 301+k) {
      ans += dp[j][l];
      ans %= mod;
    }
  }
  printf("%d\n", ans);
 
  return 0;
}

Submission Info

Judge Result