結果
問題 | No.2219 Re:010 |
ユーザー | ゆにぽけ |
提出日時 | 2024-03-12 06:12:58 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 4,110 bytes |
コンパイル時間 | 1,401 ms |
コンパイル使用メモリ | 134,520 KB |
実行使用メモリ | 5,888 KB |
最終ジャッジ日時 | 2024-09-29 22:09:46 |
合計ジャッジ時間 | 2,728 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 8 ms
5,504 KB |
testcase_04 | AC | 3 ms
5,248 KB |
testcase_05 | AC | 7 ms
5,248 KB |
testcase_06 | AC | 3 ms
5,248 KB |
testcase_07 | AC | 4 ms
5,248 KB |
testcase_08 | AC | 7 ms
5,376 KB |
testcase_09 | AC | 7 ms
5,376 KB |
testcase_10 | AC | 5 ms
5,248 KB |
testcase_11 | AC | 5 ms
5,248 KB |
testcase_12 | AC | 5 ms
5,248 KB |
testcase_13 | AC | 8 ms
5,888 KB |
testcase_14 | AC | 8 ms
5,760 KB |
testcase_15 | AC | 8 ms
5,888 KB |
testcase_16 | AC | 7 ms
5,888 KB |
testcase_17 | AC | 8 ms
5,888 KB |
testcase_18 | AC | 5 ms
5,888 KB |
testcase_19 | AC | 7 ms
5,888 KB |
testcase_20 | AC | 7 ms
5,888 KB |
testcase_21 | AC | 2 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
ソースコード
#include <iostream> #include <vector> #include <algorithm> #include <array> #include <iterator> #include <string> #include <cctype> #include <cstring> #include <cstdlib> #include <cassert> #include <cmath> #include <ctime> #include <iomanip> #include <numeric> #include <stack> #include <queue> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <bitset> #include <random> #include <utility> #include <functional> using namespace std; template<int m> struct modint { private: unsigned int value; static constexpr int mod() {return m;} public: constexpr modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= mod()) { y %= mod(); if(y < 0) y += mod(); } value = (unsigned int)y; } constexpr unsigned int val() noexcept {return value;} constexpr modint &operator+=(const modint &other) noexcept { value += other.value; if(value >= mod()) value -= mod(); return *this; } constexpr modint &operator-=(const modint &other) noexcept { unsigned int x = value; if(x < other.value) x += mod(); x -= other.value; value = x; return *this; } constexpr modint &operator*=(const modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int) (x % mod()); return *this; } constexpr modint &operator/=(const modint &other) noexcept { return *this *= other.inverse(); } constexpr modint inverse() const noexcept { assert(value); long long a = value,b = mod(),x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return modint(x); } constexpr modint power(long long N) const noexcept { assert(N >= 0); modint p = *this,ret = 1; while(N) { if(N & 1) ret *= p; p *= p; N >>= 1; } return ret; } constexpr modint operator+() {return *this;} constexpr modint operator-() {return modint() - *this;} constexpr modint &operator++(int) noexcept {return *this += 1;} constexpr modint &operator--(int) noexcept {return *this -= 1;} friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;} friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;} friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;} friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;} friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;} }; using mint = modint<998244353>; /* using mint = modint<1000000007>; */ template<class S> struct combination { private: vector<S> f,invf; public: combination(int N = 0) : f(1,1),invf(1,1) { update(N); } void update(int N) { if((int)f.size() > N) return; int pi = (int)f.size(); N = max(N,pi*2); f.resize(N+1),invf.resize(N+1); for(int i = pi;i <= N;i++) f[i] = f[i-1]*i; invf[N] = S(1)/f[N]; for(int i = N-1;i >= pi;i--) invf[i] = invf[i+1]*(i+1); } S factorial(int N) { update(N); return f[N]; } S invfactorial(int N) { update(N); return invf[N]; } S P(int N,int K) { assert(0 <= K && K <= N); update(N); return f[N]*invf[N-K]; } S C(int N,int K) { assert(0 <= K && K <= N); update(N); return f[N]*invf[K]*invf[N-K]; } }; combination<mint> C; void Main() { string S; cin >> S; int N = (int)S.size(); vector<int> Z(N + 1),Q(N + 1); for(int i = 0;i < N;i++) { Z[i + 1] = Z[i] + (S[i] == '0'); Q[i + 1] = Q[i] + (S[i] == '?'); } mint ans = 0; vector<mint> T(N + 1); T[0] = 1; for(int i = 1;i <= N;i++) { T[i] = T[i - 1] * 2; } for(int i = 0;i < N;i++) { if(S[i] == '1' || S[i] == '?') { mint L = 0,R = 0; { int c = Z[i]; int q = Q[i]; L += c * T[q]; if(q > 0) { L += q * T[q - 1]; } } { int c = Z[N] - Z[i + 1]; int q = Q[N] - Q[i + 1]; R += c * T[q]; if(q > 0) { R += q * T[q - 1]; } } ans += L * R; } } cout << ans << "\n"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; /* cin >> tt; */ while(tt--) Main(); }