#861934 (C++17) No.2279 OR Insertion

• 問題: No.2279 OR Insertion
• ユーザー: asaringo
• 提出日時: 2023-04-22 01:31:30
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,658 ms / 2,000 ms
• コード長: 4,071 bytes
• コンパイル時間: 2,028 ms
• コンパイル使用メモリ: 206,340 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-04-24 10:43:32
• 合計ジャッジ時間: 41,406 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	169 ms; 6,940 KB
testcase_03	AC	78 ms; 6,944 KB
testcase_04	AC	1,338 ms; 6,944 KB
testcase_05	AC	22 ms; 5,376 KB
testcase_06	AC	536 ms; 5,376 KB
testcase_07	AC	604 ms; 5,376 KB
testcase_08	AC	185 ms; 5,376 KB
testcase_09	AC	775 ms; 5,376 KB
testcase_10	AC	1,325 ms; 5,376 KB
testcase_11	AC	144 ms; 5,376 KB
testcase_12	AC	1,010 ms; 5,376 KB
testcase_13	AC	57 ms; 5,376 KB
testcase_14	AC	76 ms; 5,376 KB
testcase_15	AC	674 ms; 5,376 KB
testcase_16	AC	11 ms; 5,376 KB
testcase_17	AC	520 ms; 5,376 KB
testcase_18	AC	908 ms; 5,376 KB
testcase_19	AC	1,183 ms; 5,376 KB
testcase_20	AC	598 ms; 5,376 KB
testcase_21	AC	443 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	1 ms; 5,376 KB
testcase_25	AC	1 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB
testcase_29	AC	1 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	1 ms; 5,376 KB
testcase_32	AC	1,498 ms; 5,376 KB
testcase_33	AC	1,510 ms; 5,376 KB
testcase_34	AC	1,483 ms; 5,376 KB
testcase_35	AC	1,509 ms; 5,376 KB
testcase_36	AC	1,505 ms; 5,376 KB
testcase_37	AC	1,500 ms; 5,376 KB
testcase_38	AC	1,502 ms; 5,376 KB
testcase_39	AC	1,504 ms; 5,376 KB
testcase_40	AC	1,658 ms; 5,376 KB
testcase_41	AC	1,554 ms; 5,376 KB
testcase_42	AC	1,472 ms; 5,376 KB
testcase_43	AC	1,475 ms; 5,376 KB
testcase_44	AC	1,479 ms; 5,376 KB
testcase_45	AC	1,473 ms; 5,376 KB
testcase_46	AC	1,470 ms; 5,376 KB
testcase_47	AC	1,467 ms; 5,376 KB
testcase_48	AC	1,461 ms; 5,376 KB
testcase_49	AC	1,455 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std ;
#define fast_input_output ios::sync_with_stdio(false); cin.tie(nullptr);
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll ;
typedef long double ld ;
typedef pair<ll,ll> P ;
typedef tuple<ll,ll,ll> TP ;
#define chmin(a,b) a = min(a,b)
#define chmax(a,b) a = max(a,b)
#define bit_count(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl
#define DEBUG(...) ; cout << #__VA_ARGS__ << endl ; for(auto x : {__VA_ARGS__}) cout << x << "  " ; cout << endl ;
#define DEBUG_LIST(...) cout << #__VA_ARGS__ << endl ; DEBUG_REP(__VA_ARGS__) ;
#define DEBUG_REP(V) cout << "{ " ; repi(itr,V) cout << *itr << ", " ; cout << "}" << endl ;
#define debug(a) cout << #a << " " << a << endl
#define all(a) a.begin(), a.end()
#define endl "\n"

const int mod = 998244353 ;

template< int mod >
struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }

    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt< mod >(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

using modint = ModInt< mod >;

modint powmod(modint x , ll n){
    modint res = 1 ;
    while(n > 0){
        if(n & 1) (res *= x);
        (x *= x);
        n >>= 1 ;
    }
    return res ;
}

int n;
string S;

int main(){
    // fast_input_output
    cin >> n >> S;
    vector<modint> A(n);
    rep(i,n) A[i] = S[i] - '0';
    modint res = 0;
    rrep(i,1,n+1){
        vector<vector<modint>> dp(n+1,vector<modint>(2,0));
        vector<vector<modint>> sp(n+1,vector<modint>(2,0));
        dp[0][0] = 1;
        sp[0][0] = 1;
        rrep(j,1,n+1){
            if(j-i>=0){
                dp[j][1] += sp[j-1][1];
                if(S[j-i] == '1'){
                    dp[j][1] += sp[j-i][0];
                    dp[j][0] += sp[j-1][0] - sp[j-i][0];
                }
                else{
                    dp[j][0] += sp[j-1][0];
                }
            }
            else{
                dp[j][0] += sp[j-1][0];
            }
            sp[j][1] = sp[j-1][1] + dp[j][1];
            sp[j][0] = sp[j-1][0] + dp[j][0];
        }
        res += dp[n][1] * powmod(2,i-1);
    }
    cout << res << endl;
}