zoj 3466（插头DP 多条回路 六边形）

 

The Hive II

---

Time Limit: 5 Seconds       Memory Limit: 65536 KB

---

There is a hive in the village. Like this. There are 8 columns(from A to H) in this hive. Different colums have the same number of grids. Every grid has its own coordinate, which is formed by two uppercases, representing the row index and the column index. The row index starts from A. And the hive has less than ten rows in total. The following figure shows a hive with two rows.

There is honey in some grids. A naughty bee discovers this special hive and hopes to eat all honey in the hive. However, this strange bee sets some rules for itself while eating. They are descirbed as following:

• It must eat the honey by choosing a circuit and then eat all honey that is in the chosen circuit.
• Honey will disappear immediately after the bee eats it.
• All grids which are in the circuit should has honey in it.
• The length of the circuit should be no less than 3.
• The bee can choose more than one circuit to eat honey.

Given the hive and the honey in it, how many different ways can this naughty bee eat all honey in the hive?

Input

There are multiple test cases.

For each case, there are two integers N(0 < N ≤ 10) and M(0 ≤ M ≤ N * 8) in the first line. N represents the size of the hive, which means there are N rows in the hive in total. All grids have honey in it except for those M grids listed in the following line. Each empty grid is described by its coordinate(using two uppercases).

Output

For each case, output the number of different ways the bee can eat all honey in the hive. It's guaranteed that the answer does not exceed 2⁶³ - 1.

Sample Input

3 5
BB CD BF AH CG

Sample Output

3

Hint

The following figure shows all different ways for the sample. The black grids represent those which are initially empty.

---

 

Author: MO, Luyi
Contest: ZOJ Monthly, January 2011

分析：此题为连通性dp（插头DP），可以横着dp，也可以竖着dp，竖着来会超时，因为n<=10>8。。。不管怎样，状态转移都差不多，用二进制表示每个插头的状态，如图‍

黑色箭头表示所有的插头，每一行转移都先转移在上面的BDFH，即偶数列，每一格控制三个插头的状态，用8进制表示，插头的状态由上面三个黑色转移到下面三个红色，ACEG的转移类似。。。

把状态的连接保存在数组中，转移时直接枚举然后用位移计算相应的位置，并计算状态。。。

(000)<->(101,110,011)   (100,010,001)<->(100,010,001) 这些状态互相转化。。。

代码（写得好挫，不过还是可以AC的）：

#include<cstdio> #include<cstring> using namespace std; int i,k,sh,g1,g2,n,m,s,tmp,h[8][3],t[8]; long long f[2][327680]; bool g[11][11]; char c[5]; inline void dp(int j) { for(;j<8;j+=2) for(g1=!g1,g2=!g2,s=0;s<32768;++s) { if(j)sh=(j<<1)-1,tmp=(s>>sh)&7;else tmp=s&3,sh=0; if(g[i][j]) { for(f[g2][s]=k=0;k<t[tmp];++k) if((j&&j<7)||(h[tmp][k]&4)==0) f[g2][s]+=f[g1][s^(h[tmp][k]<<sh)]; } else f[g2][s]=tmp?0:f[g1][s]; } } int main() { t[0]=3;h[0][0]=3;h[0][1]=5;h[0][2]=6; t[1]=3;h[1][0]=0;h[1][1]=3;h[1][2]=5; t[2]=3;h[2][0]=0;h[2][1]=3;h[2][2]=6; t[3]=1;h[3][0]=3; t[4]=3;h[4][0]=0;h[4][1]=5;h[4][2]=6; t[5]=1;h[5][0]=5; t[6]=1;h[6][0]=6; t[7]=0; while(scanf("%d%d",&n,&m)!=-1) { memset(g,1,sizeof(g)); for(i=0;i<m;++i)scanf("%s",c),g[c[0]-'A'][c[1]-'A']=0; memset(f[0],0,sizeof(f[0])); for(f[0][0]=g1=1,g2=i=0;i<n;++i)dp(1),dp(0); printf("%lld/n",f[g2][0]); } return 0; } 

竖着来写比较简单，方法类似横着，不过因为这题数据原因，只能超时了。。。‍：

#include<cstdio> #include<cstring> using namespace std; int p[11]={0,0,32,128,512,2048,8192,32768,131072,524288,2097152}; int i,j,k,g1,g2,n,m,s,tmp,h[8][3],t[8]; long long f[2][2097152]; bool g[11][11]; char c[5]; int main() { t[0]=3;h[0][0]=3;h[0][1]=5;h[0][2]=6; t[1]=3;h[1][0]=0;h[1][1]=3;h[1][2]=5; t[2]=3;h[2][0]=0;h[2][1]=3;h[2][2]=6; t[3]=1;h[3][0]=3; t[4]=3;h[4][0]=0;h[4][1]=5;h[4][2]=6; t[5]=1;h[5][0]=5; t[6]=1;h[6][0]=6; t[7]=0; while(scanf("%d%d",&n,&m)!=-1) { memset(g,1,sizeof(g)); for(i=0;i<m;++i)scanf("%s",c),g[c[1]-'A'][c[0]-'A']=0; memset(f,0,sizeof(f)); f[0][0]=1; for(g1=1,g2=i=0;i<8;++i) { for(j=0;g1=!g1,g2=!g2,j<n;++j) for(s=0;s<p[n];++s) { tmp=(s>>(j<<1))&7; if(g[i][j])for(f[g2][s]=k=0;k<t[tmp];++k)f[g2][s]+=f[g1][s^(h[tmp][k]<<(j<<1))]; else f[g2][s]=tmp?0:f[g1][s]; } memset(f[g2],0,sizeof(f[g2])); for(s=0;s<p[n];++s) if(i&1)f[g2][s]=s&(1|(p[n]>>1))?0:f[g1][s]; else if((j=s<<2)<p[n])f[g2][j]=f[g1][s]; } printf("%lld/n",f[g2][0]); } return 0; }