Open the Lock

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

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

21234214411119999

 

Sample Output

24

 

Author

YE, Kai

 

Source

Zhejiang University Local Contest 2005

 

Recommend

Ignatius.L   |   We have carefully selected several similar problems for you:  1175 1240 1044 1254 1241 

#include<iostream>#include<cstdio>#include<cstring>#include<queue>using namespace std;struct node{    int num[4];    int step;};node fis,la;int visit[12][12][12][12];void bfs(){    queue<node>q;    int i,j;    int flag;    memset(visit,0,sizeof(visit));//表示变量    fis.step=0;    flag=1;    visit[fis.num[0]][fis.num[1]][fis.num[2]][fis.num[3]]=1;    node p;    q.push(fis);    while(!q.empty())    {     fis=q.front();     q.pop();     flag=1;     for(i=0;i<4;i++)     {         if(fis.num[i]!=la.num[i])         {             flag=0;             break;         }     }     if(flag)     {        printf("%d\n",fis.step);        return;     }     for(i=0;i<4;i++)//-1     {         p=fis;         if(fis.num[i]==1)         p.num[i]=9;         else         p.num[i]=fis.num[i]-1;         p.step=fis.step+1;         if(!visit[p.num[0]][p.num[1]][p.num[2]][p.num[3]])         {             visit[p.num[0]][p.num[1]][p.num[2]][p.num[3]]=1;             q.push(p);         }     }     for(i=0;i<4;i++)//+1     {         p=fis;         if(fis.num[i]==9)         p.num[i]=1;         else         p.num[i]=fis.num[i]+1;         p.step=fis.step+1;         if(!visit[p.num[0]][p.num[1]][p.num[2]][p.num[3]])         {             visit[p.num[0]][p.num[1]][p.num[2]][p.num[3]]=1;             q.push(p);         }     }    for(i=0;i<3;i++)//交换    {        p=fis;        p.num[i]=fis.num[i+1];        p.num[i+1]=fis.num[i];        p.step=fis.step+1;        if(!visit[p.num[0]][p.num[1]][p.num[2]][p.num[3]])        {             visit[p.num[0]][p.num[1]][p.num[2]][p.num[3]]=1;             q.push(p);        }    }    }}int main(){   int i,j,t;   scanf("%d",&t);   char a[5];   char b[5];   while(t--)   {       scanf("%s",a);       scanf("%s",b);       for(i=0;i<4;i++)       fis.num[i]=a[i]-'0';       for(i=0;i<4;i++)       la.num[i]=b[i]-'0';       bfs();   }    return 0;}