結果

問題 No.2164 Equal Balls
ユーザー tko919tko919
提出日時 2022-12-15 16:18:00
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,385 ms / 5,000 ms
コード長 8,890 bytes
コンパイル時間 2,500 ms
コンパイル使用メモリ 210,068 KB
実行使用メモリ 13,032 KB
最終ジャッジ日時 2024-04-26 17:22:39
合計ジャッジ時間 33,049 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
7,936 KB
testcase_01 AC 10 ms
7,936 KB
testcase_02 AC 10 ms
7,936 KB
testcase_03 AC 10 ms
7,936 KB
testcase_04 AC 11 ms
8,192 KB
testcase_05 AC 10 ms
8,064 KB
testcase_06 AC 11 ms
7,936 KB
testcase_07 AC 10 ms
7,936 KB
testcase_08 AC 71 ms
9,984 KB
testcase_09 AC 57 ms
9,088 KB
testcase_10 AC 38 ms
8,704 KB
testcase_11 AC 131 ms
10,268 KB
testcase_12 AC 78 ms
9,852 KB
testcase_13 AC 51 ms
8,940 KB
testcase_14 AC 63 ms
9,084 KB
testcase_15 AC 125 ms
10,156 KB
testcase_16 AC 72 ms
9,568 KB
testcase_17 AC 24 ms
8,320 KB
testcase_18 AC 95 ms
10,148 KB
testcase_19 AC 159 ms
11,328 KB
testcase_20 AC 83 ms
10,180 KB
testcase_21 AC 19 ms
8,320 KB
testcase_22 AC 19 ms
8,192 KB
testcase_23 AC 555 ms
9,852 KB
testcase_24 AC 408 ms
11,804 KB
testcase_25 AC 526 ms
9,088 KB
testcase_26 AC 231 ms
11,512 KB
testcase_27 AC 465 ms
12,568 KB
testcase_28 AC 508 ms
12,580 KB
testcase_29 AC 187 ms
9,204 KB
testcase_30 AC 433 ms
11,092 KB
testcase_31 AC 708 ms
9,728 KB
testcase_32 AC 508 ms
12,036 KB
testcase_33 AC 351 ms
8,960 KB
testcase_34 AC 461 ms
9,760 KB
testcase_35 AC 93 ms
8,192 KB
testcase_36 AC 931 ms
12,688 KB
testcase_37 AC 943 ms
9,728 KB
testcase_38 AC 1,338 ms
13,028 KB
testcase_39 AC 1,385 ms
12,904 KB
testcase_40 AC 1,332 ms
13,032 KB
testcase_41 AC 1,338 ms
12,908 KB
testcase_42 AC 1,325 ms
12,904 KB
testcase_43 AC 1,340 ms
12,904 KB
testcase_44 AC 1,333 ms
13,032 KB
testcase_45 AC 1,338 ms
12,792 KB
testcase_46 AC 1,328 ms
12,796 KB
testcase_47 AC 1,333 ms
12,904 KB
testcase_48 AC 1,344 ms
13,032 KB
testcase_49 AC 902 ms
9,600 KB
testcase_50 AC 902 ms
9,472 KB
testcase_51 AC 905 ms
9,728 KB
testcase_52 AC 909 ms
9,472 KB
testcase_53 AC 891 ms
9,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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;
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;}

#include <unistd.h>

class FastIO{
    static constexpr int L=1<<16;
    char rdbuf[L];
    int rdLeft=0,rdRight=0;
    inline void reload(){
        int len=rdRight-rdLeft;
        memmove(rdbuf,rdbuf+rdLeft,len);
        rdLeft=0,rdRight=len;
        rdRight+=fread(rdbuf+len,1,L-len,stdin);
    }
    inline bool skip(){
        for(;;){
            while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;
            if(rdLeft==rdRight){
                reload();
                if(rdLeft==rdRight)return false;
            }
            else break;
        }
        return true;
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        if(rdbuf[rdLeft]!='.')return true;
        rdLeft++;
        T base=.1;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x+=base*(rdbuf[rdLeft++]^48);
            base*=.1;
        }
        if(neg)x=-x;
        return true;
    }
    inline bool _read(char& x){
        if(!skip())return false;
        if(rdLeft+1>=rdRight)reload();
        x=rdbuf[rdLeft++];
        return true;
    }
    inline bool _read(string& x){
        if(!skip())return false;
        for(;;){
            int pos=rdLeft;
            while(pos<rdRight and rdbuf[pos]>' ')pos++;
            x.append(rdbuf+rdLeft,pos-rdLeft);
            if(rdLeft==pos)break;
            rdLeft=pos;
            if(rdLeft==rdRight)reload();
            else break;
        }
        return true;
    }
    template<typename T>inline bool _read(vector<T>& v){
        for(auto& x:v){
            if(!_read(x))return false;
        }
        return true;
    }

    char wtbuf[L],tmp[50];
    int wtRight=0;
    inline void flush(){
        fwrite(wtbuf,1,wtRight,stdout);
        wtRight=0;
    }
    inline void _write(const char& x){
        if(wtRight>L-32)flush();
        wtbuf[wtRight++]=x;
    }
    inline void _write(const string& x){
        for(auto& c:x)_write(c);
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){
        if(wtRight>L-32)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {
                switch (sizeof(x)) {
                case 2: _write("32768"); return;
                case 4: _write("2147483648"); return;
                case 8: _write("9223372036854775808"); return;
                }
            }
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    template<typename T>inline void _write(const vector<T>& v){
        rep(i,0,v.size()){
            if(i)_write(' ');
            _write(v[i]);
        }
    }
public:
    FastIO(){}
    ~FastIO(){flush();}
    inline void read(){}
    template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){
        assert(_read(head));
        read(tail...);
    }
    template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\n');}
    template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){
        if(space)_write(' ');
        _write(head);
        write<ln,true>(tail...);
    }
};

/**
 * @brief Fast IO
 */

template<int mod=1000000007>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(ll x){v=(x<mod?x:x-mod); return *this;}
    fp operator-()const{return fp()-*this;}
    fp pow(ll t){assert(t>=0); 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;}
    bool operator==(const fp& x)const{return v==x.v;}
    bool operator!=(const fp& x)const{return v!=x.v;}
    friend istream& operator>>(istream& is,fp& x){return is>>x.v;}
    friend ostream& operator<<(ostream& os,const fp& x){return os<<x.v;}
};
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);}
};

/**
 * @brief Modint
 */


template<typename T,unsigned p=3>struct NTT{
    vector<T> rt,irt;
    NTT(int lg=21){
        unsigned m=T::get_mod()-1; T prt=p;
        rt.resize(lg); irt.resize(lg);
        rep(k,0,lg){
            rt[k]=-prt.pow(m>>(k+2));
            irt[k]=rt[k].inv();
        }
    }
    void ntt(vector<T>& f,bool inv=0){
        int n=f.size();
        if(inv){
            for(int m=1;m<n;m<<=1){ T w=1;
                for(int s=0,t=0;s<n;s+=m*2){
                    for(int i=s,j=s+m;i<s+m;i++,j++){
                        auto x=f[i],y=f[j];
                        f[i]=x+y; f[j]=(x-y)*w;
                    } w*=irt[__builtin_ctz(++t)];
                }
             } T mul=T(n).inv(); rep(i,0,n)f[i]*=mul;
        }else{
            for(int m=n;m>>=1;){ T w=1;
                for(int s=0,t=0;s<n;s+=m*2){
                    for(int i=s,j=s+m;i<s+m;i++,j++){
                        auto x=f[i],y=f[j]*w;
                        f[i]=x+y; f[j]=x-y;
                    } w*=rt[__builtin_ctz(++t)];
                }
            }
         }
    }
    vector<T> mult(const vector<T>& a,const vector<T>& b,bool same=0){
        if(a.empty() or b.empty())return vector<T>();
        int n=a.size()+b.size()-1,m=1<<__lg(n*2-1);
        vector<T> res(m); rep(i,0,a.size()){res[i]=a[i];} ntt(res);
        if(same)rep(i,0,m)res[i]*=res[i];
        else{
            vector<T> c(m); rep(i,0,b.size())c[i]=b[i];
            ntt(c); rep(i,0,m)res[i]*=c[i];
        } ntt(res,1); res.resize(n); return res;
    }
};

/**
 * @brief Number Theoretic Transform
 */

using Fp=fp<998244353>;
factorial<Fp> fact(402020);
NTT<Fp,3> ntt;

const int offset=300;

FastIO io;
int main(){
    int n,m;
    cin>>n>>m;
    vector<int> a(n),b(n);
    rep(i,0,n)cin>>a[i];
    rep(i,0,n)cin>>b[i];

    deque<vector<Fp>> deq;
    rep(i,0,m){
        vector<Fp> add;
        rep(d,-300,301){
            add.push_back(1);
            for(int j=i;j<n;j+=m)add.back()*=fact.nCr(a[j]+b[j],a[j]+d);
        }
        deq.push_back(add);
    }
    while(deq.size()>1){
        auto f=deq.front();
        deq.pop_front();
        auto g=deq.front();
        deq.pop_front();
        deq.push_back(ntt.mult(f,g));
    }
    Fp ret=deq.front()[300*m];
    cout<<ret.v<<'\n';
    return 0;
}
0