#include #define REP(i,n) for(int i=0,i##_len=int(n);i>s; // iに置けるパターンの個数 ll from[4] = {}, to[4] = {}; constexpr ll mod = 998244353; from[0] = 1; for(const auto &c:s) { to[0] = from[0]; if(c == '0') { to[1] = (from[0] + from[1]) % mod; to[2] = from[2]; to[3] = (from[2] + from[3]) % mod; } else if(c == '1'){ to[1] = from[1]; to[2] = (from[1] + from[2]) % mod; to[3] = from[3]; } else { to[0] = 2 *from[0] % mod; to[1] = (from[0] + 2*from[1]) % mod; to[2] = (from[1] + 2*from[2]) % mod; to[3] = (from[2] + 2*from[3]) % mod; } swap(from, to); // REP(cnt, 4) cerr << from[cnt] << " \n"[cnt+1==4]; } cout << from[3] << endl; }