hdu-6341-搜索

Problem J. Let Sudoku Rotate

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 530    Accepted Submission(s): 146

Problem Description

Sudoku is a logic-based, combinatorial number-placement puzzle, which is popular around the world.
In this problem, let us focus on puzzles with 16×16 grids, which consist of 4×4 regions. The objective is to fill the whole grid with hexadecimal digits, i.e. 0123456789ABCDEF, so that each column, each row, and each region contains all hexadecimal digits. The figure below shows a solved sudoku.

Yesterday, Kazari solved a sudoku and left it on the desk. However, Minato played a joke with her - he performed the following operation several times.
* Choose a region and rotate it by 90 degrees counterclockwise.
She burst into tears as soon as she found the sudoku was broken because of rotations.
Could you let her know how many operations her brother performed at least?

 

Input

The first line of the input contains an integer T (1≤T≤103) denoting the number of test cases.
Each test case consists of exactly 16 lines with 16 characters each, describing a broken sudoku.

 

Output

For each test case, print a non-negative integer indicating the minimum possible number of operations.

 

Sample Input

1
681D5A0C9FDBB2F7
0A734B62E167D9E5
5C9B73EF3C208410
F24ED18948A5CA63
39FAED5616400B74
D120C4B7CA3DEF38
7EC829A085BE6D51
B56438F129F79C2A
5C7FBC4E3D08719F
AE8B1673BF42A58D
60D3AF25619C30BE
294190D8EA57264C
C7D1B35606835EAB
AF52A1E019BE4306
8B36DC78D425F7C9
E409492FC7FA18D2

 

Sample Output

5

Hint

The original sudoku is same as the example in the statement.

　　当时总感觉复杂度会炸，后来看题解才悟到其实由于数独的限制性较强，可以减去很大一部分无用解，然后就是普通的深搜了，

关键在于如何处理这个棋盘，我是一个一个区域处理的，枚举每个区域的旋转次数，如果和之前的不冲突就往下一个区域dfs，注意的是

函数返回的时候要将rotate过得区域再ratate回去。

　　

 #include<bits/stdc++.h>
 using namespace std;
 #define inf 0x3f3f3f3f
 int ans,h[],c[],e[][],g[][];
 bool vis[];
 void rotate(int a,int b){
     int i1,i2,j1,j2;
     for(i1=*a-,j2=*b-;i1<=*a;++i1,j2++){
         for(j1=*b-,i2=*a;j1<=*b;++j1,i2--){
             g[i1][j1]=e[i2][j2];
         }
     }
     for(int i=*a-;i<=*a;++i){
         for(int j=*b-;j<=*b;++j){
             e[i][j]=g[i][j];
         }
     }
 }
 bool ok(int x,int y){
     for(int i=*x-;i<=*x;++i){
         memset(vis,,sizeof(vis));
         for(int j=;j<=y*;++j){
             if(vis[e[i][j]]) return ;
             vis[e[i][j]]=;
         }
     }
     for(int j=*y-;j<=*y;++j){
         memset(vis,,sizeof(vis));
         for(int i=;i<=*x;++i){
             if(vis[e[i][j]]) return ;
             vis[e[i][j]]=;
         }
     }
     return ;
 }
 void dfs(int x,int y,int tmp){
     if(x>){
         if(tmp<ans) ans=tmp;
         return;
     }
     if(tmp>=ans) return;
     for(int i=;i<;++i){
             if(i) rotate(x,y);
             if(ok(x,y)){
                 if(y==) dfs(x+,,tmp+i);
                 else dfs(x,y+,tmp+i);
             }
     }
     rotate(x,y);//再转一次相当于归回原位
 }
 int main(){
     int t,n,m,i,j,k;
     char ch;
     cin>>t;
     while(t--){
         for(i=;i<=;++i){
             for(j=;j<=;++j){
                 cin>>ch;
                 e[i][j]=isdigit(ch)?ch-'':ch-'A'+;
             }
         }
         ans=inf;
         dfs(,,);
         cout<<ans<<endl;
     }
     return ;
 }