【搜索】bzoj3109 [cqoi2013]新数独

搜索，没什么好说的。要注意读入。

Code:

 #include<cstdio>
 #include<cstdlib>
 using namespace std;
 const int num[][]=
 {{,,,,,,,,,},
 {,,,,,,,,,},
 {,,,,,,,,,},
 {,,,,,,,,,},
 {,,,,,,,,,},
 {,,,,,,,,,},
 {,,,,,,,,,},
 {,,,,,,,,,},
 {,,,,,,,,,},
 {,,,,,,,,,}};
 int map[][][][],vish[][],visl[][],visn[][],chess[][],h=,l=;
 char s[];
 void Read()
 {
     for(int k=;k<=;k++)
       {
           for(int j=;j<=;j++)
           {
               for(int i=;i<=;i++)
               {
                   scanf("%s",s);
                 map[h][l][h][l-]= ( s[]=='>' ? - :  );
                 scanf("%s",s);
                 map[h][l+][h][l]= ( s[]=='<' ?  : - );
                 l+=;
               }
             for(int i=;i<=;i++)
               {
                   scanf("%s",s);
                 map[h+][i][h][i]= ( s[]=='v' ? - :  );
               }
             h++;l=;
           }
         for(int i=;i<=;i++)
           {
               scanf("%s",s);
             map[h][l][h][l-]= ( s[]=='>' ? - :  );
             scanf("%s",s);
             map[h][l+][h][l]= ( s[]=='<' ?  : - );
             l+=;
           }
         h++;l=;
       }
 }
 void print()
 {
     for(int i=;i<=;i++)
       {
           for(int j=;j<;j++)
             printf("%d ",chess[i][j]);
           printf("%d\n",chess[i][]);
       }
 }
 bool check(const int &X,const int &Y,const int &Val)
 {
     if(map[X][Y][X][Y-]==)
       if(Val<=chess[X][Y-])return false;
     if(map[X][Y][X][Y-]==-)
       if(Val>=chess[X][Y-])return false;
     if(map[X][Y][X-][Y]==)
       if(Val<=chess[X-][Y])return false;
     if(map[X][Y][X-][Y]==-)
       if(Val>=chess[X-][Y])return false;
     return true;
 }
 void dfs(int x,int y)
 {
     if(x==)
       {
           print();
           exit();
       }
     for(int i=;i<=;i++)
       if(!vish[x][i]&&!visl[y][i]&&!visn[num[x][y]][i])
         if(check(x,y,i))
           {
             chess[x][y]=i;
             vish[x][i]=visl[y][i]=visn[num[x][y]][i]=true;
             if(y==)
               dfs(x+,);
             else
               dfs(x,y+);
             vish[x][i]=visl[y][i]=visn[num[x][y]][i]=false;
           }
 }
 int main()
 {
     Read();
     dfs(,);
     return ;
 }