Submission #3884359
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using lint = long long int;
using ulint = unsigned long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T, class U> void assign(V<T>& v, int n, const U& a) { v.assign(n, a); }
template<class T, class... Args> void assign(V<T>& v, int n, const Args&... args) { v.resize(n); for (auto&& e : v) assign(e, args...); }
template<class Int> constexpr bool is_prime(Int n) {
if (n < 2 or n > 2 and ~n & 1) return false;
for (Int i = 3; i * i <= n; i += 2) if (n % i == 0) return false;
return true;
}
template<uint P> struct ModInt {
static_assert(is_prime(P), "template argument must be a prime number");
using M = ModInt;
uint v;
ModInt() : v(0) {}
template<class Int> ModInt(Int x) : v(x >= 0 ? x % P : -x % P ? P - -x % P : 0) {}
ModInt(uint v, int _) : v(v) {} // 直接値を初期化
static constexpr uint p() { return P; }
M operator++(int) { M t = *this; if (++v == P) v = 0; return t; }
M operator--(int) { M t = *this; v = (v ? v : P) - 1; return t; }
M& operator++() { if (++v == P) v = 0; return *this; }
M& operator--() { v = (v ? v : P) - 1; return *this; }
M operator+() const { return *this; }
M operator-() const { return {v ? P - v : 0, 0}; }
explicit operator bool() const noexcept { return v; }
bool operator!() const noexcept { return !static_cast<bool>(*this); }
M operator*(M rhs) const { return M(*this) *= rhs; }
M operator/(M rhs) const { return M(*this) /= rhs; }
M operator+(M rhs) const { return M(*this) += rhs; }
M operator-(M rhs) const { return M(*this) -= rhs; }
bool operator==(M rhs) { return v == rhs.v; }
bool operator!=(M rhs) { return !(*this == rhs); }
M& operator*=(M rhs) { v = (ulint) v * rhs.v % P; return *this; }
M& operator/=(M rhs) { return *this *= rhs.inv(); }
M& operator+=(M rhs) { v = rhs.v < P - v ? v + rhs.v : v - (P - rhs.v); return *this; }
M& operator-=(M rhs) { v = rhs.v <= v ? v - rhs.v : v + (P - rhs.v); return *this; }
M inv() const {
assert(v);
#ifdef __linux__ // ACとCFで動作を変えるための仮の対処
return pow(P - 2);
#else
int a = v, b = P, x = 1, u = 0;
while (b) {
int q = a / b;
swap(a -= q * b, b);
swap(x -= q * u, u);
}
return x;
#endif
}
template<class Int> M pow(Int n) const {
n = n >= 0 ? n % (P - 1) : P - 1 - -n % (P - 1);
M res = 1;
for (M a = *this; n > 0; a *= a, n >>= 1) if (n & 1) res *= a;
return res;
}
template<class Int> friend M operator*(Int lhs, M rhs) { return M(lhs) *= rhs; }
template<class Int> friend M operator/(Int lhs, M rhs) { return M(lhs) /= rhs; }
template<class Int> friend M operator+(Int lhs, M rhs) { return M(lhs) += rhs; }
template<class Int> friend M operator-(Int lhs, M rhs) { return M(lhs) -= rhs; }
friend ostream& operator<<(ostream& os, M rhs) { return os << rhs.v; }
friend istream& operator>>(istream& is, M& rhs) { lint x; is >> x; rhs = x; return is; }
template<class Int> friend bool operator==(Int lhs, M rhs) { return M(lhs) == rhs; }
template<class Int> friend bool operator!=(Int lhs, M rhs) { return !(lhs == rhs); }
};
using Mint = ModInt<static_cast<uint>(1e9 + 7)>;
int main() {
cin.tie(nullptr); ios_base::sync_with_stdio(false);
int n, k; cin >> n >> k;
string s; cin >> s;
VV<Mint> dp0, dp1;
assign(dp0, n + 1, n + 1, 0);
dp0[0][0] = 1;
for (int i = 0; i < n; ++i) {
assign(dp1, n + 1, n + 1, 0);
if (s[i] == '1' or s[i] == '?') {
for (int d = 0; d <= i; ++d) {
for (int j = 0; j < d; ++j) {
dp1[d][j + 1] += dp0[d][j];
}
dp1[d + 1][d + 1] += dp0[d][d];
}
}
if (s[i] == '0' or s[i] == '?') {
for (int d = 0; d <= i; ++d) {
dp1[d + 1][0] += dp0[d][0];
for (int j = 1; j <= d; ++j) {
dp1[d][j - 1] += dp0[d][j];
}
}
}
swap(dp0, dp1);
}
Mint res = 0;
for (int d = 0; d <= k; ++d) for (int j = 0; j <= d; ++j) {
res += dp0[d][j];
}
cout << res << '\n';
}
Submission Info
Submission Time |
|
Task |
C - 偶然ジェネレータ |
User |
risujiroh |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4254 Byte |
Status |
AC |
Exec Time |
28 ms |
Memory |
1024 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 |
1 ms |
256 KB |
subtask0-sample-02.txt |
AC |
1 ms |
256 KB |
subtask0-sample-03.txt |
AC |
1 ms |
256 KB |
subtask0-sample-04.txt |
AC |
1 ms |
256 KB |
subtask1-01.txt |
AC |
3 ms |
384 KB |
subtask1-02.txt |
AC |
1 ms |
256 KB |
subtask1-03.txt |
AC |
1 ms |
256 KB |
subtask1-04.txt |
AC |
1 ms |
256 KB |
subtask1-05.txt |
AC |
1 ms |
256 KB |
subtask1-06.txt |
AC |
1 ms |
256 KB |
subtask1-07.txt |
AC |
1 ms |
256 KB |
subtask1-08.txt |
AC |
1 ms |
256 KB |
subtask1-09.txt |
AC |
1 ms |
256 KB |
subtask1-10.txt |
AC |
1 ms |
256 KB |
subtask2-01.txt |
AC |
3 ms |
384 KB |
subtask2-02.txt |
AC |
7 ms |
512 KB |
subtask2-03.txt |
AC |
28 ms |
1024 KB |
subtask2-04.txt |
AC |
27 ms |
1024 KB |
subtask2-05.txt |
AC |
27 ms |
1024 KB |
subtask2-06.txt |
AC |
26 ms |
1024 KB |
subtask2-07.txt |
AC |
28 ms |
1024 KB |
subtask2-08.txt |
AC |
25 ms |
1024 KB |
subtask2-09.txt |
AC |
27 ms |
1024 KB |
subtask2-10.txt |
AC |
26 ms |
1024 KB |
subtask3-01.txt |
AC |
14 ms |
768 KB |
subtask3-02.txt |
AC |
24 ms |
1024 KB |
subtask3-03.txt |
AC |
27 ms |
1024 KB |
subtask3-04.txt |
AC |
23 ms |
1024 KB |
subtask3-05.txt |
AC |
23 ms |
1024 KB |
subtask3-06.txt |
AC |
27 ms |
1024 KB |
subtask3-07.txt |
AC |
28 ms |
1024 KB |
subtask3-08.txt |
AC |
26 ms |
1024 KB |
subtask3-09.txt |
AC |
26 ms |
1024 KB |
subtask3-10.txt |
AC |
27 ms |
1024 KB |