HDU1372:Knight Moves

点击打开题目链接

Knight Moves Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4339    Accepted Submission(s): 2693 Problem Description 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.    Input 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.    Output For each test case, print one line saying "To get from xx to yy takes n knight moves.".    Sample Input e2 e4 a1 b2 b2 c3 a1 h8 a1 h7 h8 a1 b1 c3 f6 f6   Sample Output To get from e2 to e4 takes 2 knight moves. 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.   Source University of Ulm Local Contest 1996   Recommend Eddy

=====================================题目大意=====================================

给出两个坐标，求解“马”从一个坐标至另一个坐标的最少移动步数。

=====================================算法分析=====================================

BFS。

=======================================代码=======================================

#include<queue>
#include<cstdio>
#include<cstring>

using namespace std;

#define STEP(CUR)    Step[CUR.x][CUR.y]                           //坐标CUR对应步数
#define SAME(A,B)    ((A.x==B.x)&&(A.y==B.y))                     //坐标A,B是否相同
#define LEGCORD(CUR) (0<=CUR.x&&CUR.x<=7&&0<=CUR.y&&CUR.y<=7)     //坐标CUR是否合法

const int Dir[8][2]= {{-2,1},{2,1},{2,-1},{-2,-1},{1,2},{1,-2},{-1,2},{-1,-2}};

int Step[10][10];

struct coord { int x,y; }S,E;

int BFS()
{
	if(SAME(S,E)) return 0;
	queue<coord>q; 
	memset(Step,0,sizeof(Step));
	for(q.push(S);!q.empty();q.pop())
	{
		struct coord cur=q.front(); 
		for(int n=0;n<8;++n)
		{
			struct coord tmp=cur;
			tmp.x+=Dir[n][0];
			tmp.y+=Dir[n][1];
			if(LEGCORD(tmp)&&!STEP(tmp))
			{
				STEP(tmp)=STEP(cur)+1;
				if(SAME(tmp,E)) return STEP(tmp);
				q.push(tmp);
			}
		}
	}
}

int main()
{
	char str[10];
	while(gets(str)!=NULL)
	{
		S.x=str[0]-'a';  E.x=str[3]-'a';
		S.y=str[1]-'1';  E.y=str[4]-'1';
		printf("%To get from %c%c to %c%c takes %d knight moves.\n",str[0],str[1],str[3],str[4],BFS());
	}
	return 0;
}