首页 > 代码库 > HDU1195Open the Lock(BFS)
HDU1195Open the Lock(BFS)
Open the Lock
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.
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.
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
#include<stdio.h> #include<queue> #include<iostream> using namespace std; struct node { int a; int t; }; int s,e; int toDigit(int a[]) { int ans=0; for(int i=0;i<4;i++) ans=ans*10+a[i]; return ans; } void toSprit(int a[],int ans) { int i=4; while(i>0) { a[--i]=ans%10; ans/=10; } } int bfs() { queue<node>q; node p,tp; int vist[10000]={0},a[6]; if(s==e) return 0; p.a=s; p.t=0; q.push(p); vist[s]=1; while(!q.empty()) { p=q.front(); q.pop(); toSprit(a,p.a); tp.t=p.t+1; for(int i=0;i<4;i++) { if(a[i]==9) a[i]=1;//+1 else a[i]+=1; tp.a=toDigit(a); if(tp.a==e) return tp.t; if(vist[tp.a]==0) q.push(tp),vist[tp.a]=1; if(a[i]==1)a[i]=9; else a[i]--; if(a[i]==1) //-1 a[i]=9; else a[i]-=1; tp.a=toDigit(a); if(tp.a==e) return tp.t; if(vist[tp.a]==0) q.push(tp),vist[tp.a]=1; if(a[i]==9)a[i]=1;else a[i]++; if(i<3) //与前一个交换 { int tem=a[i]; a[i]=a[i+1]; a[i+1]=tem; tp.a=toDigit(a); if(tp.a==e) return tp.t; if(vist[tp.a]==0) q.push(tp),vist[tp.a]=1; tem=a[i]; a[i]=a[i+1]; a[i+1]=tem; } } } return -1; } int main() { int t; scanf("%d",&t); while(t--) { scanf("%d%d",&s,&e); int time=bfs(); printf("%d\n",time); } }
HDU1195Open the Lock(BFS)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。