首页 > 代码库 > poj 1915 Knight Moves(bfs)

poj 1915 Knight Moves(bfs)

2024-08-04 08:15:09   226人阅读

Knight Moves
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 22204 Accepted: 10374

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

Source

TUD Programming Contest 2001, Darmstadt, Germany


题目描述：

在一个n*n 的棋盘上，给一个骑士的起点和一个终点，并给出骑士8种移动方式，求骑士从起点到终点的最小步数.

简单bfs.

CODE:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<queue>
#include<stack>
#include<vector>
#include<map>

#define N 100010
#define Mod 10000007
#define lson l,mid,idx<<1
#define rson mid+1,r,idx<<1|1
#define lc idx<<1
#define rc idx<<1|1
const double EPS = 1e-11;
const double PI = acos ( -1.0 );
typedef long long ll;

const int INF = 1000010;

using namespace std;

int n, x, y, s, e;
bool vis[310][310];

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

struct moves
{
    int x, y;
    int mos;
} ss;

queue<moves>mp;

int bfs()
{
    memset ( vis, false, sizeof ( vis ) );
    while ( mp.size() )
    {
        mp.pop();
    }
    mp.push ( ss );
    vis[x][y] = true;
    int ans;
    moves t, tt;
    while ( mp.size() )
    {
        tt = mp.front();
        mp.pop();
        if ( tt.x == s && tt.y == e )
            break;
        for ( int i = 0; i < 8; i++ )
        {
            if ( tt.x + xx[i] >= 0 && tt.x + xx[i] < n && tt.y + yy[i] >= 0 && tt.y + yy[i] < n && !vis[tt.x + xx[i]][tt.y + yy[i]] )
            {
                t.x = tt.x + xx[i], t.y = tt.y + yy[i], t.mos = tt.mos + 1;
                mp.push ( t );
                vis[tt.x + xx[i]][tt.y + yy[i]] = true;
            }
        }
    }
    return tt.mos;
}

int main()
{
    int t;
    while ( cin >> t )
    {
        while ( t-- )
        {
            cin >> n >> x >> y >> s >> e;
            ss.x = x;
            ss.y = y;
            ss.mos = 0;
            cout << bfs() << endl;
        }
    }
    return 0;
}



poj 1915 Knight Moves(bfs)


联系
我们