UVALive 4763

一开始，没敢写，感觉会超时。。。其实就是暴力搜索。DFS

 #include<iostream>
 #include<stdio.h>
 #include<string.h>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #define clc(a,b) memset(a,b,sizeof(a))
 #define N 100
 #define eps 1e-6
 #include<stack>
 #include<deque>
 #include<vector>
 using namespace std;
 const int  MAXD = 1e5+;
 const int  MAXM = ;
 const int  INF = 0x3f3f3f3f;
 typedef long long ll;

 char G[][];
 int  row[][],coloum[][],cr[][],row1[];
 int t;
 int sum;
 void dfs(int x,int y)
 {
     if(x==)
     {
         sum++;
         return;
     }
     if(G[x][y]>=''&&G[x][y]<='')
     {
         if(y==)
             dfs(x+,);
         else
             dfs(x,y+);
         return ;
     }
     else if(G[x][y]=='e')
     {
         int flag=;
         for(int i=; i<; i=i+)
         {
             if(!row[x][i]&&!coloum[y][i]&&!cr[(x/)*+y/+][i])
             {
                 flag=;
                 G[x][y]=i+'';
                 row[x][i]=;
                 coloum[y][i]=;
                 cr[(x/)*+y/+][i]=;
                 if(y==)
                     dfs(x+,);
                 else
                     dfs(x,y+);
                 G[x][y]='e';
                 row[x][i]=;
                 coloum[y][i]=;
                 cr[(x/)*+y/+][i]=;
             }
         }
         if(!flag)
             return;
     }
     else if(G[x][y]=='o')
     {
         int flag=;
         for(int i=; i<=; i=i+)
         {
             if(!row[x][i]&&!coloum[y][i]&&!cr[(x/)*+y/+][i])
             {
                 flag=;
                 G[x][y]=i+'';
                 row[x][i]=;
                 coloum[y][i]=;
                 cr[(x/)*+y/+][i]=;
                 if(y==)
                     dfs(x+,);
                 else
                     dfs(x,y+);
                 G[x][y]='o';
                 row[x][i]=;
                 coloum[y][i]=;
                 cr[(x/)*+y/+][i]=;
             }
         }
         if(!flag)
             return ;
     }
     else if(G[x][y]>='a'&&G[x][y]<='z'&&G[x][y]!='e'&&G[x][y]!='o')
     {
         int num=G[x][y]-'a';
         if(row1[num])
         {
             if(!row[x][row1[num]]&&!coloum[y][row1[num]]&&!cr[(x/)*+y/+][row1[num]])
             {
                 G[x][y]=row1[num]+'';
                 row[x][row1[num]]=;
                 coloum[y][row1[num]]=;
                 cr[(x/)*+y/+][row1[num]]=;
                 if(y==)
                     dfs(x+,);
                 else
                     dfs(x,y+);
                 G[x][y]=num+'a';
                 row[x][row1[num]]=;
                 coloum[y][row1[num]]=;
                 cr[(x/)*+y/+][row1[num]]=;
             }
             else
                 return ;
         }
         else
         {
             int flag=;
             for(int i=; i<=; i++)
             {
                 if(row[x][i]==&&coloum[y][i]==&&cr[(x/)*+y/+][i]==)
                 {
                     flag=;
                     row1[num]=i;
                     G[x][y]=i+'';
                     row[x][i]=;
                     coloum[y][i]=;
                     cr[(x/)*+y/+][i]=;
                     if(y==)
                         dfs(x+,);
                     else
                         dfs(x,y+);
                     G[x][y]=num+'a';
                     row1[num]=;
                     row[x][i]=;
                     coloum[y][i]=;
                     cr[(x/)*+y/+][i]=;
                 }
             }
             if(flag==)
                 return ;
         }
     }
     else if(G[x][y]=='')
     {
         int flag=;
         for(int i=; i<=; i++)
         {
             if(!row[x][i]&&!coloum[y][i]&&cr[(x/)*+y/+][i]==)
             {
                 flag=;
                 G[x][y]=i+'';
                 row[x][i]=;
                 coloum[y][i]=;
                 cr[(x/)*+y/+][i]=;
                 if(y==)
                     dfs(x+,);
                 else
                     dfs(x,y+);
                 G[x][y]='';
                 row[x][i]=;
                 coloum[y][i]=;
                 cr[(x/)*+y/+][i]=;
             }
         }
         if(flag==)
             return;
     }
 }

 int main()
 {
     //freopen("in.txt","r",stdin);
     scanf("%d",&t);
     while(t--)
     {
         sum=;
         clc(row,);
         clc(coloum,);
         clc(cr,);
         clc(row1,);
         for(int i=;i<;i++)
         {
             scanf("%s",G[i]);
         }
         for(int i=; i<; i++)
         {
             for(int j=; j<; j++)
             {

                 if(G[i][j]>=''&&G[i][j]<='')
                 {
                     row[i][G[i][j]-'']=;
                     coloum[j][G[i][j]-'']=;
                     cr[(i/)*+j/+][G[i][j]-'']=;
                 }
             }
         }
         dfs(,);
         printf("%d\n",sum);
     }
     return ;
 }