Knight Moves
来源:互联网 发布:佛本是道实战进阶数据 编辑:程序博客网 时间:2024/06/07 04:41
Knight Moves
总提交:29 测试通过:24
描述
A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determining the smallest number of knight moves between two given squares and that, once you have accomplished this, finding the tour would be easy.
Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part.
Your job is to write a program that takes two squares a and b as input and then determines the number of knight moves on a shortest route from a to b.
输入
The input file will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard.
输出
For each test case, print one line saying "To get from xx to yy takes n knight moves.".
样例输入
a1 b2
b2 c3
a1 h8
a1 h7
h8 a1
b1 c3
f6 f6
样例输出
To get from a1 to b2 takes 4 knight moves.
To get from b2 to c3 takes 2 knight moves.
To get from a1 to h8 takes 6 knight moves.
To get from a1 to h7 takes 5 knight moves.
To get from h8 to a1 takes 6 knight moves.
To get from b1 to c3 takes 1 knight moves.
To get from f6 to f6 takes 0 knight moves.
#include<iostream>#include<cstring>#include<cstdio>using namespace std;int p,q,tx,ty,min1;struct node{ int x,y,s;};void bfs(){ int tail,head,i,j,n,m,book[50][50]; struct node que[2500]; int vis[8][2]= {{-2,-1},{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2},{-1,-2}}; memset(book,0,sizeof(book)); head=tail=1; que[tail].x=tx; que[tail].y=ty; book[tx][ty]=1; tail++; int f=0; while(tail>head) { for(i=0; i<8; i++) { tx=que[head].x+vis[i][0]; ty=que[head].y+vis[i][1]; if(tx<1||ty<1||tx>8||ty>8) continue; if(book[tx][ty]==0) { book[tx][ty]=1; que[tail].x=tx; que[tail].y=ty; que[tail].s=que[head].s+1; tail++; } if(tx==p&&ty==q) { f=1; break; } } if(f==1) break; head++; } min1=que[tail-1].s;}int main(){ char a[5],b[5]; while(scanf("%s%s",a,b)!=EOF) { tx=a[0]-'a'+1; ty=a[1]-'0'; p=b[0]-'a'+1; q=b[1]-'0'; if(tx==p&&ty==q) { printf("To get from %s to %s takes 0 knight moves.\n",a,b); } else { bfs(); printf("To get from %s to %s takes %d knight moves.\n",a,b,min1); } } return 0;}
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- 浅谈Java中的equals和==
- Day6:例行性工作
- Leetcode 56 Merge Intervals
- Oracle 优化(一)
- 第四方支付平台:创新型移动支付企业
- Knight Moves
- u-boot系统启动流程分析
- 汽车前装与后装
- 用安卓发送有序广播
- 社交系统ThinkSNS+ alpha.2 版本发布,快来看看都有些什么【研发日记六】
- Unity3D 获取与设置对象Transform组件下的position,rotation
- hello 大家好
- 工厂模式
- PHP中级程序员常见面试题