Zigzag
Problem Statement
有一些点,共
n
行,第
Data Constraint
n
,
Solution
我们显然可以把一条路径表示成一个
n
-
假设已经求出第
i
-
若在第
时间复杂度
O
(
Code
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define fo(i,j,l) for(int i=j;i<=l;++i)
#define fd(i,j,l) for(int i=j;i>=l;--i)
using namespace std;
typedef long long LL;
const LL N=21,M=(1<<19)+3,mo=1e9+7;
int dir[N][N],m2[N<<1],nex[N<<1];
int n,m,k,a,b,c;
LL f[2][N][M],g[N][M];
int main()
{
cin>>n>>m>>k; --n;
fo(i,1,k){
scanf("%d%d%d",&a,&b,&c);
dir[a][b]=c+1;
}
int u=0,v;
f[0][0][0]=1;
m2[1]=1;
fo(i,2,n+1)m2[i]=m2[i-1]<<1;
int zd=(m2[n]<<1)-1;
fo(p,1,m){
v=u^1;
fo(l,0,n)fo(i,0,zd)f[v][l][i]=0;
fo(l,0,n)fo(i,0,zd)g[l][i]=0;
fd(i,zd,0){
LL ok=f[u][0][i]%mo; nex[n]=n+1;
fd(l,n,2)if(i&m2[l])nex[l-1]=l;else nex[l-1]=nex[l];
if(!i)g[0][0]=ok;
fo(l,1,n){
if((i&m2[l])==0&&dir[p][l]!=1&&nex[l]!=n+1)
f[u][l][(i^m2[nex[l]])^m2[l]]=f[u][l][(i^m2[nex[l]])^m2[l]]+ok;
ok=(f[u][l][i]+ok)%mo;
if(dir[p][l]&&(((i&m2[l])>0)-(dir[p][l]==2)))break;
if(nex[l]==n+1&&(i&m2[l])>0)g[l][i]=ok;
}
}
fo(i,0,n-1)
fo(l,0,zd)if(g[i][l]){
g[i][l]=g[i][l]%mo;
if(dir[p][i+1]!=2)g[i+1][l]=g[i+1][l]+g[i][l];
if(dir[p][i+1]!=1)g[i+1][l^m2[i+1]]=g[i+1][l^m2[i+1]]+g[i][l];
}
fo(i,0,zd)f[v][0][i]=g[n][i];
u=v;
}
LL ans=0;
fo(i,0,zd)ans=(ans+f[v][0][i])%mo;
cout<<ans;
}