#723909 (C++17) No.1761 Sequence Distance

• 問題: No.1761 Sequence Distance
• ユーザー: tko919
• 提出日時: 2021-12-13 14:40:47
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2,827 ms / 8,000 ms
• コード長: 2,813 bytes
• コンパイル時間: 2,291 ms
• コンパイル使用メモリ: 201,564 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-22 11:58:11
• 合計ジャッジ時間: 30,953 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 5,248 KB
testcase_01	AC	3 ms; 5,376 KB
testcase_02	AC	687 ms; 5,376 KB
testcase_03	AC	3 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	3 ms; 5,376 KB
testcase_06	AC	15 ms; 5,376 KB
testcase_07	AC	12 ms; 5,376 KB
testcase_08	AC	19 ms; 5,376 KB
testcase_09	AC	15 ms; 5,376 KB
testcase_10	AC	15 ms; 5,376 KB
testcase_11	AC	20 ms; 5,376 KB
testcase_12	AC	15 ms; 5,376 KB
testcase_13	AC	11 ms; 5,376 KB
testcase_14	AC	6 ms; 5,376 KB
testcase_15	AC	17 ms; 5,376 KB
testcase_16	AC	20 ms; 5,376 KB
testcase_17	AC	10 ms; 5,376 KB
testcase_18	AC	20 ms; 5,376 KB
testcase_19	AC	16 ms; 5,376 KB
testcase_20	AC	10 ms; 5,376 KB
testcase_21	AC	760 ms; 5,376 KB
testcase_22	AC	63 ms; 5,376 KB
testcase_23	AC	2,351 ms; 5,376 KB
testcase_24	AC	694 ms; 5,376 KB
testcase_25	AC	1,973 ms; 5,376 KB
testcase_26	AC	2,032 ms; 5,376 KB
testcase_27	AC	954 ms; 5,376 KB
testcase_28	AC	625 ms; 5,376 KB
testcase_29	AC	1,642 ms; 5,376 KB
testcase_30	AC	487 ms; 5,376 KB
testcase_31	AC	924 ms; 5,376 KB
testcase_32	AC	99 ms; 5,376 KB
testcase_33	AC	1,368 ms; 5,376 KB
testcase_34	AC	11 ms; 5,376 KB
testcase_35	AC	297 ms; 5,376 KB
testcase_36	AC	1,621 ms; 5,376 KB
testcase_37	AC	273 ms; 5,376 KB
testcase_38	AC	403 ms; 5,376 KB
testcase_39	AC	963 ms; 5,376 KB
testcase_40	AC	506 ms; 5,376 KB
testcase_41	AC	2,540 ms; 5,376 KB
testcase_42	AC	2,808 ms; 5,376 KB
testcase_43	AC	2,827 ms; 5,376 KB
testcase_44	AC	3 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

template<int mod=998244353>struct fp {
    int v; static int get_mod(){return mod;}
    int inv() const{
        int tmp,a=v,b=mod,x=1,y=0;
        while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
        if(x<0){x+=mod;} return x;
    }
    fp(ll x=0){init(x%mod+mod);}
    fp& init(int x){v=(x<mod?x:x-mod); return *this;}
    fp operator-()const{return fp()-*this;}
    fp pow(ll t){fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;}
    fp& operator+=(const fp& x){return init(v+x.v);}
    fp& operator-=(const fp& x){return init(v+mod-x.v);}
    fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;}
    fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;}
    fp operator+(const fp& x)const{return fp(*this)+=x;}
    fp operator-(const fp& x)const{return fp(*this)-=x;}
    fp operator*(const fp& x)const{return fp(*this)*=x;}
    fp operator/(const fp& x)const{return fp(*this)/=x;}
    friend istream& operator>>(istream& is,fp& x){return is>>x.v;}
    friend ostream& operator<<(ostream& os,const fp& x){return os<<x.v;}
}; using Fp=fp<>;
template<typename T>struct factorial {
    vector<T> Fact,Finv,Inv;
    factorial(int maxx){
        Fact.resize(maxx); Finv.resize(maxx); Inv.resize(maxx);
        Fact[0]=Fact[1]=Finv[0]=Finv[1]=Inv[1]=1;
        rep(i,2,maxx){Fact[i]=Fact[i-1]*i;} Finv[maxx-1]=Fact[maxx-1].inv();
        for(int i=maxx-1;i>=2;i--){Finv[i-1]=Finv[i]*i; Inv[i]=Finv[i]*Fact[i-1];}
    }
    T fact(int n,bool inv=0){if(n<0)return 0; return (inv?Finv[n]:Fact[n]);}
    T inv(int n){if(n<0)return 0; return Inv[n];}
    T nPr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(n-r,inv^1);}
    T nCr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(r,inv^1)*fact(n-r,inv^1);}
    T nHr(int n,int r,bool inv=0){return nCr(n+r-1,r,inv);}
};

const int SQ=35;
Fp from[1010][SQ*2+10],to[1010][SQ*2+10];

int main(){
    int n,m;
    cin>>n>>m;

    from[0][SQ]=1;
    rep(_,0,n){
        rep(i,0,m+1)rep(cur,0,SQ*2+5)to[i][cur]=0;
        rep(i,0,m+1)rep(cur,0,SQ*2+5)if(from[i][cur].v){
            int nxt=i+abs(cur-SQ);
            if(nxt>m)continue;
            to[nxt][cur]+=from[i][cur]*2;
            if(cur<SQ*2)to[nxt][cur+1]+=from[i][cur];
            if(cur>0)to[nxt][cur-1]+=from[i][cur];
        }
        swap(from,to);
    }
    cout<<from[m][SQ]<<'\n';
    return 0;
}