Hust oj 1367 King（BFS）

最新推荐文章于 2018-11-27 20:45:48 发布

19951211丶

最新推荐文章于 2018-11-27 20:45:48 发布

阅读量458

点赞数

分类专栏：搜索文章标签： BFS

本文链接：https://blog.csdn.net/Sara_YF/article/details/52050390

版权

搜索专栏收录该内容

9 篇文章 0 订阅

订阅专栏

King

Time Limit: 1000 MS

Memory Limit: 65536 K

Total Submit: 129(84 users)

Total Accepted: 91(83 users)

Rating:

Special Judge: No

Description

The king in the chessboard wonders the least number of moves to go to square t from squares. The king can move one square at a time in any direction (8 directions).

Help him to solve this problem!

Input

There are multiple test cases. The first line of input is an integer T indicating the number of test cases. Then T test cases follow.

For each test case:

Line 1. This line contains the chessboard coordinates of position s indicating the square the king is currently in.

Line 2. This line contains the chessboard coordinates of position t indicating the square the king wants to go to.

The coordinate consists of a lowercase letter from a to h and a digit from 1 to 8.

Output

For each test case:

Line 1. Output the least number of moves.

Sample Input

Sample Output

问从起点到终点最少需要多少步

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#include<map>
using namespace std;

const int maxn = 100;
int map[maxn][maxn];
int vis[maxn][maxn];
int re[maxn][maxn];
char Start[maxn];
char End[maxn];
int t;
int ans;
int sx,sy,ex,ey;
int fx[8] = {0,0,1,-1,1,1,-1,-1};
int fy[8] = {1,-1,0,0,-1,1,1,-1};
struct Point
{
    int x;
    int y;
};

Point start,nex,temp;

void bfs(int sx,int sy,int ex,int ey)
{
    queue<Point>Q;
    vis[sx][sy] = 1;
    start.x = sx;
    start.y = sy;
    Q.push(start);
    while(!Q.empty())
    {
        temp = Q.front();
        Q.pop();
        if(temp.x == ex && temp.y == ey) return;
        for(int i=0;i<8;i++)
        {
            nex.x = fx[i] + temp.x;
            nex.y = fy[i] + temp.y;
            if(nex.x >= 1 && nex.x <= 8 && nex.y >= 1 && nex.y <=8 && vis[nex.x][nex.y] == 0)
            {
                vis[nex.x][nex.y] = 1;
                re[nex.x][nex.y] = re[temp.x][temp.y] + 1;
                ans++;
                Q.push(nex);
            }
        }
    }
}

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s",&Start);
        scanf("%s",&End);
        sx = Start[0] - 'a' + 1;
        sy = Start[1] - '0';
        ex = End[0] - 'a' + 1;
        ey = End[1] - '0';
        ans = 0;
        memset(vis,0,sizeof(vis));
        memset(re,0,sizeof(re));
        bfs(sx,sy,ex,ey);
        printf("%d\n",re[ex][ey]);
    }
}