結果

問題 No.2159 Filling 4x4 array
ユーザー tko919tko919
提出日時 2022-12-12 04:47:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,458 ms / 5,000 ms
コード長 8,129 bytes
コンパイル時間 1,901 ms
コンパイル使用メモリ 202,476 KB
実行使用メモリ 78,952 KB
最終ジャッジ日時 2024-04-23 22:35:22
合計ジャッジ時間 65,405 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,318 ms
78,916 KB
testcase_01 AC 4 ms
12,744 KB
testcase_02 AC 1,329 ms
78,788 KB
testcase_03 AC 1,315 ms
78,792 KB
testcase_04 AC 1,329 ms
78,912 KB
testcase_05 AC 1,315 ms
78,788 KB
testcase_06 AC 1,317 ms
78,916 KB
testcase_07 AC 1,311 ms
78,792 KB
testcase_08 AC 1,317 ms
78,916 KB
testcase_09 AC 1,322 ms
78,916 KB
testcase_10 AC 1,350 ms
78,788 KB
testcase_11 AC 1,409 ms
78,912 KB
testcase_12 AC 1,339 ms
78,916 KB
testcase_13 AC 1,375 ms
78,792 KB
testcase_14 AC 1,380 ms
78,788 KB
testcase_15 AC 1,335 ms
78,912 KB
testcase_16 AC 1,372 ms
78,916 KB
testcase_17 AC 1,404 ms
78,784 KB
testcase_18 AC 1,409 ms
78,792 KB
testcase_19 AC 1,400 ms
78,952 KB
testcase_20 AC 1,356 ms
78,916 KB
testcase_21 AC 1,360 ms
78,916 KB
testcase_22 AC 1,399 ms
78,760 KB
testcase_23 AC 1,407 ms
78,784 KB
testcase_24 AC 1,396 ms
78,788 KB
testcase_25 AC 1,428 ms
78,916 KB
testcase_26 AC 1,415 ms
78,752 KB
testcase_27 AC 1,383 ms
78,912 KB
testcase_28 AC 1,399 ms
78,916 KB
testcase_29 AC 1,413 ms
78,792 KB
testcase_30 AC 1,407 ms
78,912 KB
testcase_31 AC 1,372 ms
78,784 KB
testcase_32 AC 1,380 ms
78,916 KB
testcase_33 AC 1,401 ms
78,792 KB
testcase_34 AC 1,400 ms
78,788 KB
testcase_35 AC 1,408 ms
78,920 KB
testcase_36 AC 1,381 ms
78,912 KB
testcase_37 AC 1,386 ms
78,916 KB
testcase_38 AC 1,423 ms
78,792 KB
testcase_39 AC 1,458 ms
78,772 KB
testcase_40 AC 1,429 ms
78,792 KB
testcase_41 AC 1,421 ms
78,792 KB
testcase_42 AC 1,423 ms
78,788 KB
testcase_43 AC 1,399 ms
78,876 KB
testcase_44 AC 1,403 ms
78,788 KB
testcase_45 AC 4 ms
14,148 KB
testcase_46 AC 4 ms
12,544 KB
testcase_47 AC 5 ms
12,672 KB
testcase_48 AC 5 ms
12,544 KB
testcase_49 AC 4 ms
12,416 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "library/Template/template.hpp"
#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;}
#line 2 "library/Utility/fastio.hpp"
#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
 */
#line 3 "sol.cpp"

#line 2 "library/Math/modint.hpp"

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
 */
#line 5 "sol.cpp"
using Fp=fp<998244353>;

Fp dp[35][1<<16];
int par[1<<16]; // parityを抜き出す
int to3[1<<16]; // 2bit->3bit
int to2[1<<24]; // 3bit->先頭2bit
vector<int> step[1<<8]; // 遷移

FastIO io;
int main(){
    int h[4],w[4];
    rep(i,0,4)io.read(h[i]),h[i]-=4;
    rep(i,0,4)io.read(w[i]),w[i]-=4;

    if(h[0]+h[1]+h[2]+h[3]!=w[0]+w[1]+w[2]+w[3]){
        io.write(0);
        return 0;
    }

    rep(mask,0,1<<16){
        rep(i,0,8)if(mask>>(i*2)&1)par[mask]|=(1<<i);
    }
    rep(mask,0,1<<16){
        rep(i,0,8)to3[mask]|=(mask>>(i*2)&3)<<(i*3);
    }
    rep(mask,0,1<<24){
        rep(i,0,8)to2[mask]|=(mask>>(i*3+1)&3)<<(i*2);
    }

    rep(mask,0,1<<16){
        int base=0,add=0;
        rep(i,0,16)if(mask>>i&1){
            base^=1<<(i/4);
            base^=1<<(i%4+4);
            add+=1<<(3*(i/4));
            add+=1<<(3*(i%4+4));
        }
        step[base].push_back(add);
    }

    dp[0][0]=1;
    rep(i,0,31){
        int parity=0;
        rep(i,0,4)if(h[i]&1)parity|=1<<i;
        rep(i,0,4)if(w[i]&1)parity|=1<<(i+4);
        rep(mask,0,1<<16){
            int exp=to3[mask];
            for(auto& add:step[par[mask]^parity]){
                dp[i+1][to2[exp+add]]+=dp[i][mask];
            }
        }
        rep(i,0,4){
            h[i]>>=1;
            w[i]>>=1;
        }
    }
    io.write(dp[31][0].v);
    return 0;
}
0