poj 1915 Knight Moves_不见不散的结局是曲终人散_新浪博客

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 23303		Accepted: 10928

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；用front记录当前位置的坐标，用rear记录下一个位置的坐标，因为坐标和步数时同时性的，所以可以开个结构体，将其存放在里面；

代码如下：

#include< cstdio >

#include< cstring >

int chess[305][305];

int x,y,x1,y1,n,ma=0;

struct node

{

    int tx,ty;

    int temp;

} knight[90005];

int vis[305][305];

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

int bfs(int x,int y)

{

    node cur;memset(vis,0,sizeof(vis));

    knight[0].tx=x;

    knight[0].ty=y;

    knight[0].temp=0;

    int front=0,rear=1;

    while(front < rear)

    {

        cur=knight[front++];

        if(cur.tx==x1&&cur.ty==y1)//遍历结束条件，因为广搜的每一步都时同时进行的，所以最先结束的即为最短需要的步数；

            return cur.temp;

        else

        {

            int i;

            for(i=0; i<8; i++)//朝找最多的八个方向搜索；

            {

                int ex=cur.tx+fun[i][0];

                int ey=cur.ty+fun[i][1];

                if(ex < n&&ey < n&&ex=0 && ey>=0 && vis[ex][ey]==0)//判断是否符合条件；

                {

                    vis[ex][ey]=1;

                    knight[rear].tx=ex;

                    knight[rear].ty=ey;

                    knight[rear++].temp=cur.temp+1;