题意:给定n*m的矩阵,求用骨牌覆盖且稳定的方案数。稳定的定义是没有一行或一列的缝隙是直接分割整个矩阵的。
分析:预处理出所有矩阵为i*j的覆盖方案,然后按列容斥按行递推。预处理可以看骨牌覆盖,然后按列容斥很简单,按行递推就是代码里的b[j]-=b[k]*a[j-k]啦。详见代码。
代码:
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=17;
const int mod=12345678;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;
ll a[N],b[N],s[N][N],ans[N][N],dp[N][1<<16];
void dfs(int x,int n,int m,int mask1,int mask2) {
if (x==m) {
(dp[n][mask1]+=dp[n-1][mask2])%=MOD;return ;
}
dfs(x+1,n,m,mask1<<1,mask2<<1|1);
dfs(x+1,n,m,mask1<<1|1,mask2<<1);
if (x+2<=m) dfs(x+2,n,m,mask1<<2|3,mask2<<2|3);
}
void deal() {
for (int i=1;i<N;i++) {
memset(dp,0,sizeof(dp));
dp[0][(1<<i)-1]=1;
for (int j=1;j<N;j++) {
dfs(0,j,i,0,0);
s[j][i]=dp[j][(1<<i)-1];
}
}
for (int i=1;i<N;i++)
for (int mask=0;mask<(1<<i-1);mask++) {
int sgn=1,last;
for (int j=0;j<i-1;j++)
if (mask&(1<<j)) sgn=-sgn;
for (int j=1;j<N;j++) {
a[j]=1ll;last=0;
for (int k=1;k<i;k++)
if (mask&(1<<k-1)) {
(a[j]*=s[j][k-last])%=MOD;last=k;
}
(a[j]*=s[j][i-last])%=MOD;
}
for (int j=1;j<N;j++) {
b[j]=a[j];
for (int k=1;k<j;k++) (b[j]-=b[k]*a[j-k]%MOD)%=MOD;
(ans[j][i]+=sgn*b[j])%=MOD;
}
}
}
int main()
{
int n,m;
deal();
while (scanf("%d%d", &n, &m)!=EOF)
printf("%lld\n", (ans[n][m]+MOD)%MOD);
return 0;
}