結果
問題 | No.2219 Re:010 |
ユーザー | miscalc |
提出日時 | 2023-02-17 22:22:45 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 50 ms / 2,000 ms |
コード長 | 3,172 bytes |
コンパイル時間 | 4,509 ms |
コンパイル使用メモリ | 269,968 KB |
実行使用メモリ | 20,096 KB |
最終ジャッジ日時 | 2024-07-19 13:31:46 |
合計ジャッジ時間 | 6,076 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 37 ms
17,664 KB |
testcase_04 | AC | 6 ms
5,376 KB |
testcase_05 | AC | 32 ms
14,720 KB |
testcase_06 | AC | 10 ms
6,400 KB |
testcase_07 | AC | 20 ms
10,368 KB |
testcase_08 | AC | 38 ms
16,768 KB |
testcase_09 | AC | 36 ms
16,384 KB |
testcase_10 | AC | 28 ms
13,312 KB |
testcase_11 | AC | 24 ms
11,520 KB |
testcase_12 | AC | 24 ms
11,776 KB |
testcase_13 | AC | 45 ms
20,096 KB |
testcase_14 | AC | 45 ms
20,096 KB |
testcase_15 | AC | 45 ms
20,096 KB |
testcase_16 | AC | 45 ms
20,096 KB |
testcase_17 | AC | 45 ms
20,096 KB |
testcase_18 | AC | 45 ms
20,096 KB |
testcase_19 | AC | 44 ms
19,968 KB |
testcase_20 | AC | 50 ms
20,096 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>; using tlll = tuple<ll, ll, ll>; constexpr ll INF = 1LL << 60; template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;} ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;} ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);} ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;} ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;} ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;} ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; } ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); } ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); } template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());} template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';} template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';} template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);} //* #include <atcoder/all> using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; //using mint = modint; //*/ int main() { string S; cin >> S; ll N = S.size(); vector dp(4, vector(4, vector(N + 1, mint(0)))); dp.at(0).at(0).at(0) = 1; const string T = "010"; for (ll i = 0; i < N; i++) { for (ll j = 0; j <= 3; j++) { for (ll k = 0; k <= 3; k++) { dp.at(j).at(k).at(i + 1) += dp.at(j).at(k).at(i); if (j == 3 || k == 3) continue; if (S.at(i) == '?' || S.at(i) == T.at(j)) { ll nj = j + 1, nk = k + (S.at(i) == '?'); dp.at(nj).at(nk).at(i + 1) += dp.at(j).at(k).at(i); } } } } /* for (ll i = 0; i < N + 1; i++) { for (ll j = 0; j < 4; j++) { for (ll k = 0; k < 4; k++) { if (dp.at(j).at(k).at(i) == 0) continue; cout << i << " " << j << " " << k << " " << dp.at(j).at(k).at(i).val() << endl; } } } //*/ ll c = count(S.begin(), S.end(), '?'); mint ans = 0; for (ll k = 0; k < 4; k++) { mint tmp = dp.at(3).at(k).at(N); if (tmp == 0) continue; ans += mint(2).pow(c - k) * tmp; } cout << ans.val() << endl; }