#862061 (C++14) No.2279 OR Insertion

• 問題: No.2279 OR Insertion
• ユーザー: woodywoody
• 提出日時: 2023-04-22 14:28:30
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 487 ms / 2,000 ms
• コード長: 4,927 bytes
• コンパイル時間: 3,857 ms
• コンパイル使用メモリ: 232,528 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-07 03:12:54
• 合計ジャッジ時間: 17,103 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	56 ms; 5,248 KB
testcase_03	AC	24 ms; 5,248 KB
testcase_04	AC	440 ms; 5,248 KB
testcase_05	AC	7 ms; 5,248 KB
testcase_06	AC	177 ms; 5,248 KB
testcase_07	AC	195 ms; 5,248 KB
testcase_08	AC	60 ms; 5,248 KB
testcase_09	AC	255 ms; 5,248 KB
testcase_10	AC	426 ms; 5,248 KB
testcase_11	AC	46 ms; 5,248 KB
testcase_12	AC	336 ms; 5,248 KB
testcase_13	AC	18 ms; 5,248 KB
testcase_14	AC	23 ms; 5,248 KB
testcase_15	AC	213 ms; 5,248 KB
testcase_16	AC	4 ms; 5,248 KB
testcase_17	AC	176 ms; 5,248 KB
testcase_18	AC	292 ms; 5,248 KB
testcase_19	AC	387 ms; 5,248 KB
testcase_20	AC	199 ms; 5,248 KB
testcase_21	AC	143 ms; 5,248 KB
testcase_22	AC	2 ms; 5,248 KB
testcase_23	AC	2 ms; 5,248 KB
testcase_24	AC	2 ms; 5,248 KB
testcase_25	AC	2 ms; 5,248 KB
testcase_26	AC	2 ms; 5,248 KB
testcase_27	AC	2 ms; 5,248 KB
testcase_28	AC	2 ms; 5,248 KB
testcase_29	AC	2 ms; 5,248 KB
testcase_30	AC	2 ms; 5,248 KB
testcase_31	AC	2 ms; 5,248 KB
testcase_32	AC	484 ms; 5,248 KB
testcase_33	AC	478 ms; 5,248 KB
testcase_34	AC	478 ms; 5,248 KB
testcase_35	AC	479 ms; 5,248 KB
testcase_36	AC	474 ms; 5,248 KB
testcase_37	AC	474 ms; 5,248 KB
testcase_38	AC	487 ms; 5,248 KB
testcase_39	AC	473 ms; 5,248 KB
testcase_40	AC	481 ms; 5,248 KB
testcase_41	AC	486 ms; 5,248 KB
testcase_42	AC	474 ms; 5,248 KB
testcase_43	AC	471 ms; 5,248 KB
testcase_44	AC	475 ms; 5,248 KB
testcase_45	AC	385 ms; 5,248 KB
testcase_46	AC	381 ms; 5,248 KB
testcase_47	AC	383 ms; 5,248 KB
testcase_48	AC	449 ms; 5,248 KB
testcase_49	AC	356 ms; 5,248 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

void solve(){
    int n; cin>>n;
    string s; cin>>s;
    mint ans = 0;
    mint all = mint(2).pow(n-1);
    if (s[n-1]=='0'){
        int cnt = 0;
        rep(i,n-1) cnt += s[i]-'0';
        ans = all-mint(2).pow(n-1-cnt);
    }else{
        ans = all;
    }
    rep1(i,n){
        vm dp(n);
        fenwick_tree<mint> fw(n);
        rep(j,n){
            if (j==0){
                dp[0] = 1;
                fw.add(j,1);
                continue;
            }
            dp[j] = fw.sum(0,j) + 1;
            int nj = j-i-1;
            if (nj+1<0){
                fw.add(j,dp[j]);
                continue;
            }
            if (s[nj+1]=='0'){
                fw.add(j,dp[j]);
                continue;
            }
            if (nj==-1) dp[j] -= 1;
            else dp[j] -= fw.sum(0,nj+1)+1;
            fw.add(j,dp[j]);
        }
        
        ans += (all-dp[n-1]) * (mint(2).pow(i));
        // outm;
    }
    outm;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}