POJ 1915 Knight Moves

Knight Moves

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 21889		Accepted: 10210

Description

Background 
Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? 
The Problem 
Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another, so that you have the chance to be faster than Somurolov. 
For people not familiar with chess, the possible knight moves are shown in Figure 1. 

Input

The input begins with the number n of scenarios on a single line by itself. 
Next follow n scenarios. Each scenario consists of three lines containing integer numbers. The first line specifies the length l of a side of the chess board (4 <= l <= 300). The entire board has size l * l. The second and third line contain pair of integers {0, ..., l-1}*{0, ..., l-1} specifying the starting and ending position of the knight on the board. The integers are separated by a single blank. You can assume that the positions are valid positions on the chess board of that scenario.

Output

For each scenario of the input you have to calculate the minimal amount of knight moves which are necessary to move from the starting point to the ending point. If starting point and ending point are equal,distance is zero. The distance must be written on a single line.

Sample Input

3
8
0 0
7 0
100
0 0
30 50
10
1 1
1 1

Sample Output

5
28
0

此题是简单的bfs（广搜），有起点，终点，找最短路，输出步数

这样找之所以为最短，是因为每次查找都是找最近的点，则最后为最短。

 
 

  
  
#include
    
    
     
     
#include
     
     
      
      
const int MAX2=310;
const int MAX1=310;
int n,x1,y1,x2,y2;
int shortest[MAX1][MAX2]={0};
bool vis[MAX1][MAX2];
int bx[]={-2,-2,-1,-1,1,1,2,2};
int by[]={-1,1,-2,2,-2,2,-1,1};
struct node/*结构体*/
{
	int x,y;
	node(){
		}
	node(int x,int y){
		this->x=x;
		this->y=y;
	}/*定义在结构体内部，指针用于赋值*/
}q[MAX1*MAX2];
void bfs(int sx,int sy,int tx,int ty)
{
	int i,j;
	int begin=0,end=0;
	shortest[sx][sy]=0;
	q[end]=node(sx,sy);/*结构体数组存放拓展点*/
	end++;
	vis[sx][sy]=true;
	while(begin
      
      
       
       =n||yy<0||yy>=n||vis[xx][yy])
    		continue;
    		vis[xx][yy]=true;
    		shortest[xx][yy]=shortest[now.x][now.y]+1;/*记录当前点步数*/
    		q[end++]=node(xx,yy);
    	}
	}
	printf("%d\n",shortest[tx][ty]);/*输出到终点的步数*/
}
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		
		scanf("%d%d%d%d%d",&n,&x1,&y1,&x2,&y2);
		if(x1==x2&&y1==y2)
		printf("%d\n",0);
		else{
		  memset(vis,0,sizeof(vis));
		   bfs(x1,y1,x2,y2);
		}
	}
	return 0;
}