BZOJ3125: CITY

心累..上次的板子是错的
今天被折腾死了….
貌似比标算多了一两个log?
反正预处理可以去掉 反正A了..我就懒得去改了

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
 #define ll long long

char c;
bool glag;
inline void read(int &a)
{

    a=0;do c=getchar();while(c!='-'&&(c<'0'||c>'9'));
    if(c=='-')glag=true,c=getchar();
    while(c<='9'&&c>='0')a=(a<<3)+(a<<1)+c-'0',c=getchar();
    if(glag)glag=false,a=-a;
}
int n,m;
const
  int INF=1<<29;
ll f[2][4594324];
bool us[16][16];
int Div[16];
int getpc(int x,int pos){return (x/Div[pos])%3;}    
int pc(int pos,int op){return op*Div[pos];}
int get1(int x,int pos,int cnt)
{
    int l=x%Div[pos];
    if(!l)return -1;
    while(pos&&(cnt||(l%Div[pos+1])/Div[pos]!=2))
        {
            if((l%Div[pos+1])/Div[pos]==2)cnt--;
            if((l%Div[pos+1])/Div[pos]==1)cnt++;
            if(cnt>0)return -1;
            pos--;
        }
    if(pos<1)return -1;
    return l%Div[pos+1]/Div[pos]!=2?-1:pos;
}
int get2(int x,int pos,int cnt)
{
    int l=x/Div[cnt?++pos:pos];
    if(!l)return -1;
    while((cnt||l%3!=1)&&pos<=m)
        {
            if(l%3==1)
                cnt--;
            else if(l%3==2)cnt++;
            if(cnt>0)return -1;
            l/=3,pos++;
        }
    if(pos+1>m)
        return -1;
    return l%3!=1?-1:pos;
}
int flag[16][16],flag2[16][16];
int main()
{
    int i,j,t;
    read(n),read(m);
    Div[0]=1;
    for(int i=1;i<=15;i++)
       Div[i]=Div[i-1]*3;
    for(i=1;i<=n;i++)
      for(j=1;j<=m;j++)
        {
            do c=getchar();while(c!='.'&&c!='#'&&c!='|'&&c!='-');
            if(c=='.')flag2[i][j]=1;
            else if(c=='#')flag2[i][j]=0;
            else if(c=='|')flag2[i][j]=2;
            else flag2[i][j]=3;
        }
     if(n<m)
     {
     for(i=1;i<=n;i++)
      for(j=1;j<=m;j++)
        {
            if(flag2[i][j]==2||flag2[i][j]==3)flag[j][i]=5-flag2[i][j];
            else flag[j][i]=flag2[i][j];
        }   
        swap(n,m);
     }
     else
     for(i=1;i<=n;i++)
      for(j=1;j<=m;j++)
        flag[i][j]=flag2[i][j];     
    int base;
    int Lim=3;
    for(int i=1;i<=m;i++)
        Lim*=3;
    Lim--;
    ll ans=-INF;
   bool F=true;
   int last=0,now=1;
   ans=0;
    int lastx=-1,lasty=-1;
    for(i=n;i;i--)
        for(j=m;j;j--)
             if(flag[i][j]==1){lastx=i,lasty=j;goto z;}
    z:for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
           {
            last^=1,now^=1;
            if(F&&flag[i][j]==1)
            {F=false,f[now][2+Div[j]]=1;continue;}
            else if(F)continue;
            for(t=0;t<=Lim;t++)
            {
                f[now][t]=0;
                if(i==2&&j==6&&t==468)
                    t++,t--;
                int rightpc=t%3,lowpc=getpc(t,j);
                if(t==0){f[now][t]=0;continue;}
                else
                {
                    if(i==1&&j==1)
                        if(t^5)continue;
                        else if(flag[i][j]==1)f[now][t]=0;
                        else;
                    else if(i==1)
                    {
                     if(lowpc==0)
                            if(rightpc==0)
                                f[now][t]=(flag[i][j]^0)?0:f[last][t];
                            else if(rightpc==1)
                                f[now][t]=((flag[i][j]^3)&&(flag[i][j]^1))?0:f[last][t];
                            else
                                f[now][t]=((flag[i][j]^3)&&(flag[i][j]^1))?0:f[last][t];
                        else if(lowpc==1)
                            if(rightpc==0)
                                f[now][t]=(flag[i][j]^1)?0:f[last][t-1*Div[j]+1];
                            else if(rightpc==1)
                                f[now][t]=0;
                            else
                                f[now][t]=(flag[i][j]^1)?0:f[last][t-2-Div[j]];
                        else
                            if(rightpc==0)
                                f[now][t]=(flag[i][j]^1)?0:f[last][t-2*Div[j]+2];
                            else if(rightpc==1)
                                f[now][t]=0;
                            else
                                f[now][t]=0; 

                    }
                    else if(j==1)
                    {
                        if(lowpc==0)
                            if(rightpc==0)
                                f[now][t]=(flag[i][j]^0)?0:f[last][t];
                            else if(rightpc==1)
                                f[now][t]=(flag[i][j]^1)?0:f[last][t-1+Div[j]];
                            else
                                f[now][t]=(flag[i][j]^1)?0:f[last][t-2+2*Div[j]];
                        else if(lowpc==1)
                            if(rightpc==0)
                                f[now][t]=((flag[i][j]^1)&&(flag[i][j]^2))?0:f[last][t];
                            else if(rightpc==1)
                                f[now][t]=0;
                            else
                                f[now][t]=(flag[i][j]^1)?0:f[last][t-2-Div[j]];
                        else
                            if(rightpc==0)
                                f[now][t]=((flag[i][j]^2)&&(flag[i][j]^1))?0:f[last][t];
                            else if(rightpc==1)
                                f[now][t]=0;
                            else
                                f[now][t]=0;
                    }
                    else
                    {
                        if(lowpc==0)
                            if(rightpc==0)
                                {
                                int p1=get1(t,j,0),p2=get2(t,j,0);
                                f[now][t]=(flag[i][j]^0)?0:f[last][t];
                                while(p1!=-1&&flag[i][j]==1)
                                    f[now][t]+=f[last][t-Div[p1]+2+Div[j]*2],p1=get1(t,p1,-1);
                                while(p2!=-1&&flag[i][j]==1)
                                    f[now][t]+=f[last][t+Div[p2]+1+Div[j]*1],p2=get2(t,p2,-1);
                                if(flag[i][j]==1)f[now][t]+=f[last][t+2+Div[j]*1];
                                }
                            else if(rightpc==1)
                                f[now][t]=
                            ((flag[i][j]^3)&&(flag[i][j]^1)?0:f[last][t])+
                            ((flag[i][j]^1)?0:f[last][t-1+Div[j]]);
                            else
                                f[now][t]=
                            ((flag[i][j]^3)&&(flag[i][j]^1)?0:f[last][t])+
                            ((flag[i][j]^1)?0:f[last][t-2+2*Div[j]]);
                        else if(lowpc==1)
                            if(rightpc==0)
                                f[now][t]=
                            ((flag[i][j]^2)&&(flag[i][j]^1)?0:f[last][t])+
                            ((flag[i][j]^1)?0:f[last][t-1*Div[j]+1]);
                            else if(rightpc==1)
                                f[now][t]=0;
                            else
                                f[now][t]=(flag[i][j]^1)?0:f[last][t-2-Div[j]];
                        else
                            if(rightpc==0)
                                f[now][t]=
                            ((flag[i][j]^2)&&(flag[i][j]^1)?0:f[last][t])+
                            ((flag[i][j]^1)?0:f[last][t-2*Div[j]+2]);
                            else if(rightpc==1)
                                f[now][t]=0;
                            else
                                f[now][t]=0;
                    }
                }
            }    
           if(i==lastx&&j+1==lasty)
            ans+=f[now][1+2*Div[j+1]];
        }
        if(F)return puts("0"),0;
    printf("%lld\n",ans);
    return 0;
}