poj 2243 骑士游历2

最新推荐文章于 2022-02-25 19:38:17 发布

baisung

最新推荐文章于 2022-02-25 19:38:17 发布

阅读量392

点赞数

本文链接：https://blog.csdn.net/baisung/article/details/7566914

版权

搜索专栏收录该内容

6 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <queue>
#include <cstring>

namespace {
    using namespace std;

    struct POS_S {
        POS_S(int, int);
        
        int x, y;
    };

    POS_S::POS_S(int pos_x, int pos_y)
    {
        x = pos_x; y = pos_y;
    }

    #define L_MAX 8
    unsigned char moves[L_MAX][L_MAX];

    #define MOVES_INFINITE 64

    int src_x, src_y, dst_x, dst_y;
    int dx[] = {-2, -1, 1, 2, 2, 1, -1, -2}, dy[] = {-1, -2, -2, -1, 1, 2, 2, 1};

    inline bool goal(int x, int y)
    {
        return (x==dst_x) && (y==dst_y);
    }

    inline bool onboard(int x, int y)
    {
        return (0<=x && x<8) && (0<=y && y<8);
    }

    inline bool visited(int x, int y)
    {
        return moves[x][y] != MOVES_INFINITE;
    }

    inline void moves_reset()
    {
        memset(moves, MOVES_INFINITE, sizeof(moves));
    }

    int knight_moves(int sx, int sy)
    {
        moves_reset();
        moves[sx][sy] = 0;

        queue<POS_S> Q;
        Q.push(POS_S(sx, sy));
        while (!Q.empty())
        {
            POS_S pos = Q.front(); Q.pop();

            if (goal(pos.x, pos.y))
            {
                return moves[pos.x][pos.y];
            }

            for (int i=0; i<8; i++)
            {
                int nx = pos.x + dx[i];
                int ny = pos.y + dy[i];
                if (onboard(nx, ny) && !visited(nx, ny))
                {
                    moves[nx][ny] = moves[pos.x][pos.y] + 1;
                    Q.push(POS_S(nx, ny));
                }
            }
        }

        return MOVES_INFINITE;
    }
}

int main()
{
    char c;
    while (cin>>c)
    {
        src_y = c - 'a';
        cin >> src_x; src_x--;

        cin >> c;
        dst_y = c - 'a';
        cin >> dst_x; dst_x--;

        cout << "To get from " << char(src_y+'a') << (src_x+1)
             << " to " << char(dst_y+'a') << (dst_x+1) << " takes "
             << knight_moves(src_x, src_y) <<  " knight moves." << endl;
    }

    return 0;
}