【jzoj5251】【GDOI2018模拟8.11】【决战】【状态压缩动态规划】

题目大意

解题思路

设f[i][j][s]表示第i行放了j个哲学家01状态是s，预处理转移方法，计算j的上下界优化常数即可以通过。实在不行就手动开o2。

code

#pragma GCC optimize(2)
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LF double
#define LL long long
#define ULL unsigned int
#define fo(i,j,k) for(int i=j;i<=k;i++)
#define fd(i,j,k) for(int i=j;i>=k;i--)
#define fr(i,j) for(int i=begin[j];i;i=next[i])
using namespace std;
int const mn=2500+1,mo=998244353;
int n,m,a[5][5],b[5][5],c[10][10],d[10],f[2][8][mn*3],fact[mn*3],ni[mn*3],
    w[8][2]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
inline int min(int x,int y){
    return (x<y)?x:y;
}
inline int max(int x,int y){
    return (x>y)?x:y;
}
int pow(int x,int y){
    int z=1;
    while(y){
        if(y&1)z=1ll*z*x%mo;
        x=1ll*x*x%mo;
        y>>=1;
    }
    return z;
}
int main(){
    freopen("d.in","r",stdin);
    freopen("d.out","w",stdout);
    scanf("%d%d",&n,&m);
    fo(i,1,3)fo(j,1,3)scanf("%d",&a[i][j]);
    fo(i,0,7)fo(j,0,7){
        int ii=i,jj=j,tmp=0;
        fd(k,3,1)b[1][k]=ii&1,tmp+=ii&1,ii>>=1;
        fd(k,3,1)b[2][k]=jj&1,jj>>=1;
        int ok=1;d[i]=tmp;
        fo(ii,1,2)fo(jj,1,3)fo(k,0,7)
            if(b[ii][jj]&&a[2+w[k][0]][2+w[k][1]]&&b[ii+w[k][0]][jj+w[k][1]])
                {ok=0;break;}
        if(ok)c[i][++c[i][0]]=j;
    }
    if(c[7][0]==8){
        fact[0]=1;n*=3;
        fo(i,1,n)fact[i]=1ll*fact[i-1]*i%mo;
        ni[n]=pow(fact[n],mo-2);
        fd(i,n-1,0)ni[i]=1ll*ni[i+1]*(i+1)%mo;
        printf("%d",1ll*fact[n]*ni[m]%mo*ni[n-m]%mo);
        return 0;
    }
    fo(j,1,c[0][0])f[1][c[0][j]][d[c[0][j]]]=1;int tm2,tm3,tm4,tmp,tm5,lim,lim2;
    fo(i,1,n-1){
        tmp=i&1,tm5=1-tmp,lim=min(3*i,m),lim2=min(3*(i+1),m);
        fo(j,0,7)fo(k,max(0,m-(n-i-1)*3),lim2)f[tm5][j][k]=0;
        fo(j,0,7)fo(k,max(0,m-(n-i)*3),lim)if(f[tmp][j][k]){
            tm4=c[j][0];
            fo(kk,1,tm4){
                tm2=c[j][kk],tm3=f[tm5][tm2][k+d[tm2]]+f[tmp][j][k];
                f[tm5][tm2][k+d[tm2]]=(tm3>=mo)?tm3-mo:tm3;
            }
        }
    }
    int ans=0;tmp=n&1;
    fo(k,0,7)ans=(ans+f[tmp][k][m])%mo;
    printf("%d",ans);
    return 0;
}