一眼矩乘DP
我们发现最后一列一定有两个点可以向后伸展,剩下那个点要么已经被占用了要么还没被占用,也就是说一共有六种状态,瞎jb矩乘一下即可
#include<iostream>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<bitset>
#include<set>
#include<stack>
#include<vector>
#include<queue>
using namespace std;
#define MAXN 1010
#define MAXM 1010
#define ll long long
#define eps 1e-8
#define MOD 1000000000
#define INF 1000000000
struct mat{
int x[6][6];
mat(){
memset(x,0,sizeof(x));
}
friend mat operator *(const mat &x,const mat &y){
int i,j,k;
mat z;
for(i=0;i<6;i++){
for(j=0;j<6;j++){
for(k=0;k<6;k++){