[数形结合 数位DP] BZOJ 2917 [Poi1998]Painter’s Studio

以左下角为(0,0)建立坐标系，考虑一个点a,b存在一个洞（称为yes(a,b)）的条件为存在i使得a的第i个二进制位为0，b的第i个二进制位为1，故问题转化为求所有a,b使

 a,b,a+x,b+y∈[0,2^n-1] and yes(a,b) and yes(a+x,b+y)

    使用递推解决：

    f[I,0..1,0..1]表示第i位至第n位，a是否得到了了前n-1位的进位，b是否得到了前n-1位的进位的方案数。

    初始f[n+1,0,0]=1   Ans=f[1,0,0]

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

inline int read(int *x){
  char c=nc(); int len=0;
  for (;!(c>='0' && c<='9');c=nc());
  for (;c>='0' && c<='9';x[++len]=c-'0',c=nc()); return len;
}

const int con=100000000;  
class Int{  
public:long long a[10];  
  void getdata(int x){memset(a,0,sizeof(a));while (x){a[++a[0]]=x%con;x=x/con;}}  
  void pri(bool flag){  
    if (a[0]==0||(a[0]==1&&a[1]==0)){printf("0");if (flag)printf("\n");return;}  
    printf("%lld",a[a[0]]);  
    for (int i=a[0]-1;i;i--)  
      printf("%08lld",a[i]);  
    if (flag)printf("\n");  
  }  
  bool operator <(const Int &X){  
    if (a[0]<X.a[0])return true;if (a[0]>X.a[0])return false;  
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return true;if (a[i]>X.a[i])return false;}  
    return false;  
  }  
  bool operator >(const Int &X){  
    if (a[0]<X.a[0])return false;if (a[0]>X.a[0])return true;  
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return false;if (a[i]>X.a[i])return true;}  
    return false;  
  }  
  bool operator <=(const Int &X){  
    if (a[0]<X.a[0])return true;if (a[0]>X.a[0])return false;  
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return true;if (a[i]>X.a[i])return false;}  
    return true;  
  }  
  bool operator >=(const Int &X){  
    if (a[0]<X.a[0])return false;if (a[0]>X.a[0])return true;  
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return false;if (a[i]>X.a[i])return true;}  
    return true;  
  }  
  bool operator ==(const Int &X){  
    if (a[0]!=X.a[0])return false;for (int i=a[0];i;i--)if (a[i]!=X.a[i])return false;  
    return true;  
  }  
  Int operator +(const Int &X){  
    Int c;memset(c.a,0,sizeof(c.a));  
    for (int i=1;i<=a[0]||i<=X.a[0];i++)  
      {c.a[i]=c.a[i]+a[i]+X.a[i];c.a[i+1]+=c.a[i]/con;c.a[i]%=con;}  
    c.a[0]=max(a[0],X.a[0]);if (c.a[c.a[0]+1])c.a[0]++;  
    return c;  
  }  
  Int operator +(int num){  
    Int c;memcpy(c.a,a,sizeof(c.a));c.a[1]+=num;  
    for (int i=1;i<=c.a[0]&&c.a[i]>=con;i++)c.a[i]-=con,c.a[i+1]++;  
    while (c.a[c.a[0]+1])c.a[0]++;  
    return c;  
  }  
  Int operator -(const Int &X){  
    Int c;memcpy(c.a,a,sizeof(c.a));  
    for (int i=1;i<=a[0];i++){c.a[i]=c.a[i]-X.a[i];if (c.a[i]<0){c.a[i+1]--;c.a[i]+=con;}}  
    while (c.a[0]&&!c.a[c.a[0]])c.a[0]--;  
    return c;  
  }  
  Int operator -(int num){  
    Int c;memcpy(c.a,a,sizeof(c.a));c.a[1]-=num;  
    for (int i=1;i<=c.a[0]&&c.a[i]<0;i++)c.a[i]+=con,c.a[i+1]--;  
    while (c.a[0]&&!c.a[c.a[0]])c.a[0]--;  
    return c;  
  }  
  Int operator *(const Int &X){  
    Int c;memset(c.a,0,sizeof(c.a));  
    for (int i=1;i<=a[0];i++)for (int j=1;j<=X.a[0];j++)  
                   {c.a[i+j-1]+=a[i]*X.a[j];c.a[i+j]+=c.a[i+j-1]/con;c.a[i+j-1]%=con;}  
    c.a[0]=max(a[0]+X.a[0]-1,0ll);if (c.a[a[0]+X.a[0]]>0)c.a[0]++;  
    return c;  
  }  
  Int operator *(int num){  
    Int c;memset(c.a,0,sizeof(c.a));  
    for (int i=1;i<=a[0];i++){c.a[i]+=a[i]*num;if (c.a[i]>=con){c.a[i+1]+=c.a[i]/con;c.a[i]%=con;}}  
    c.a[0]=a[0];if (c.a[c.a[0]+1]>0)c.a[0]++;  
    return c;  
  }  
  Int operator /(int num){  
    Int c;memset(c.a,0,sizeof(c.a));  
    long long x=0;for (int i=a[0];i;i--){x=x*con+a[i];c.a[i]=x/num;x=x%num;}  
    c.a[0]=a[0];if (c.a[0]&&!c.a[c.a[0]])c.a[0]--;  
    return c;  
  }  
};  

const int N=105;

int n;
int x[N],y[N];
Int f[N][2][2];
int a[55],len;

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n);
  len=read(a); reverse(a+1,a+len+1);
  for (int i=1;i<=n;i++){
    x[i]=a[1]&1;
    for (int j=len,rest=0;j;j--)
      rest=rest*10+a[j],a[j]=rest/2,rest=rest%2;
  }
  len=read(a); reverse(a+1,a+len+1);
  for (int i=1;i<=n;i++){
    y[i]=a[1]&1;
    for (int j=len,rest=0;j;j--)
      rest=rest*10+a[j],a[j]=rest/2,rest=rest%2;
  }
  f[0][0][0].getdata(1);
  for (int t=0;t<n;t++)
    for (int i=0;i<2;i++)
      for (int j=0;j<2;j++)
	for (int u=0;u<2;u++)
	  for (int v=0;v<2;v++){
	    if (u==0 && v==1) continue;
	    if ((u+i+x[t+1])%2==0 && (v+j+y[t+1])%2==1) continue;
	    f[t+1][(u+i+x[t+1])/2][(v+j+y[t+1])/2]=f[t+1][(u+i+x[t+1])/2][(v+j+y[t+1])/2]+f[t][i][j];
	  }
  f[n][0][0].pri(1);
  return 0;
}