hdu 1195 Open the Lock (BFS)

Open the Lock

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3388    Accepted Submission(s): 1499

Problem Description

Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. 
Each time, you can add or minus 1 to any digit. When add 1 to '9', the digit will change to be '1' and when minus 1 to '1', the digit will change to be '9'. You can also exchange the digit with its neighbor. Each action will take one step.

Now your task is to use minimal steps to open the lock.

Note: The leftmost digit is not the neighbor of the rightmost digit.

 

Input

The input file begins with an integer T, indicating the number of test cases.

Each test case begins with a four digit N, indicating the initial state of the password lock. Then followed a line with anotther four dight M, indicating the password which can open the lock. There is one blank line after each test case.

 

Output

For each test case, print the minimal steps in one line.

 

Sample Input

2
1234
2144

1111
9999

 

Sample Output

2
4

 

Author

YE, Kai

 

Source

Zhejiang University Local Contest 2005

 

Recommend

Ignatius.L   |   We have carefully selected several similar problems for you:  1175 1072 1026 1180 1044 

 

 //15MS    340K    1607 B    C++
 /*

     题意：
         给出两个四位数，有两种操作，相邻交换或每位+/-1;
         求最少步数使第一串变为第二串

     bfs:
         细心点就可以过，先考虑每一次最多可以有多少步可以走，因为只有四位数，
     而且有两种操作，一共有七步，相邻交换有三步，每位操作有四步，知道这个然后就常规的
     bfs求解。 

 */
 #include<iostream>
 #include<queue>
 using namespace std;
 struct node{
     int a,cnt;
 };
 int a,b;
 int vis[];
 int bfs()
 {
     memset(vis,,sizeof(vis));
     queue<node>Q;
     node t={a,};
     vis[a]=;
     Q.push(t);
     while(!Q.empty()){
         t=Q.front();
         Q.pop();
         if(t.a==b) return t.cnt;
         node tt=t;
         tt.cnt++;
         tt.a=t.a%+(t.a/)*+(t.a%)/*;
         if(!vis[tt.a]){
             Q.push(tt);vis[tt.a]=;
             //printf("1*%d\n",tt.a);
         }
         tt.a=t.a/*+(t.a%)/*+(t.a%)/*+t.a%;
         if(!vis[tt.a]){
             Q.push(tt);vis[tt.a]=;
              //printf("2*%d\n",tt.a);
         }
         tt.a=t.a/*+(t.a%)*+(t.a%)/;
         if(!vis[tt.a]){
             Q.push(tt);vis[tt.a]=;
              //printf("3*%d\n",tt.a);
         }

         for(int i=;i<;i*=){
             int temp=(t.a%(i*))/i;
             if(temp==) tt.a=t.a-*i;
             else tt.a=t.a+i;
             if(!vis[tt.a]){
                 Q.push(tt);vis[tt.a]=;
                 //printf("4*%d\n",tt.a);
             }
             if(temp==) tt.a=t.a+*i;
             else tt.a=t.a-i;
             if(!vis[tt.a]){
                 Q.push(tt);vis[tt.a]=;
                 //printf("5*%d\n",tt.a);
             }
         }
         if(t.a<) return ;
     }
     return ;
 }
 int main(void)
 {
     int t;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%d%d",&a,&b);
         printf("%d\n",bfs());
     }
     return ;
 }