[JZOJ4787] 数格子

Description

Solution

经典的问题。

状压$DP$，每一行$0$表示不对下一行这个位置产生影响，反之为$1$

可以随便搞一个$dfs$弄出转移矩阵，直接上就好了

Code

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<cstring>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fod(i,a,b) for(i=a;i>=b;i--)
#define N 16
using namespace std;
struct arr
{
    long long a[N][N];
}ans,s,f;
int n,m,g[4];
void dfs(int k,int sz,int tz,bool bz)
{
    if(k>3) 
    {
        if (!bz) f.a[sz][tz]++;
        return;
    }
    if (g[k]==0)
    {
        if (!bz)dfs(k+1,sz,tz+(1<<k),0);
        dfs(k+1,sz,tz,!bz);
    }
    else
    {
        if (bz) return;
        dfs(k+1,sz,tz,0);
    }
}
arr ti(arr a,arr b)
{
    arr c;
    int i,j,k;
    fo(i,0,N-1)
    {
        fo(j,0,N-1)
        {
            c.a[i][j]=0;
            fo(k,0,N-1)
            {
                c.a[i][j]=(c.a[i][j]+a.a[i][k]*b.a[k][j])%m;
            }
        }
    }
    return c;
}
arr ksm(arr k,int n)
{
    if (n==1) return k;
    arr s1=ksm(k,n/2);
    if(n%2==0) return ti(s1,s1);
    else return ti(ti(s1,s1),k);
}
int main()
{
    int i,j;
    fo(i,0,N-1)
    {
        fo(j,0,3) g[j]=(1<<j)&i;
        dfs(0,i,0,0); 
    }
    scanf("%d%d",&n,&m);
    memset(ans.a,0,sizeof(ans.a));
    ans.a[0][0]=1;
    while(n!=0)
    {
        s=ans;
        s=ti(s,ksm(f,n));
        printf("%lld\n",s.a[0][0]);
        scanf("%d%d",&n,&m);
    }
}