POJ 1915 Knight Moves

Knight Moves

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 19506		Accepted: 8986

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 <stdio.h>
#include <queue>
#include <string.h>
#include <iostream>
using namespace std;

typedef struct node
{
    int x;
    int y;
    int step;
}Node;

int Map[310][310];
int dir[8][2]={-1,2,1,2,2,1,2,-1,1,-2,-1,-2,-2,-1,-2,1};

void BFS(int n, int sx, int sy, int ex, int ey)
{
    if (sx == ex && sy == ey)
    {
        printf("0
");
        return;
    }
    Node temp;
    queue<Node> Queue;
    temp.x = sx;
    temp.y = sy;
    temp.step = 0;
    Map[sx][sy] = 1;
    Queue.push(temp);
    while(!Queue.empty())
    {
        temp.x = Queue.front().x;
        temp.y = Queue.front().y;
        temp.step = Queue.front().step;
        Queue.pop();
        if (temp.x == ex && temp.y == ey)
        {
            printf("%d
", temp.step);
            return;
        }
        for (int i = 0; i < 8; i++)
        {
            Node Next;
            Next.x = temp.x + dir[i][0];
            Next.y = temp.y + dir[i][1];
            Next.step = temp.step + 1;
            if (Next.x >= 0 && Next.x < n && Next.y >= 0 && Next.y < n && Map[Next.x][Next.y] == 0)
            {
                Map[Next.x][Next.y] = 1;
                Queue.push(Next);
            }
        }
    }
}

int main()
{
    int nCase;
    int n;
    int sx, sy, ex, ey;
    scanf("%d", &nCase);
    for (int i = 0; i < nCase; i++)
    {
        memset(Map, 0, sizeof(Map));
        scanf("%d", &n);
        scanf("%d%d%d%d", &sx, &sy, &ex, &ey);
        BFS(n, sx, sy, ex, ey);
    }
    return 0;
}