ACM篇：POJ3984--迷宫问题

最新推荐文章于 2022-05-26 11:00:14 发布

Ace_is_my_name

最新推荐文章于 2022-05-26 11:00:14 发布

阅读量488

点赞数

分类专栏： acm 文章标签： acm poj

本文链接：https://blog.csdn.net/Ace_is_my_name/article/details/53104333

版权

acm 专栏收录该内容

54 篇文章 0 订阅

订阅专栏

水水

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

const int N = 5;
struct Point
{
    int x, y;
    int last;
    Point(int x=0, int y=0,int last=-1)
    {
        this->x = x; 
        this->y = y;
        this->last = last;
    }
};

const int ROW[] = {1, -1, 0, 0};
const int COL[] = {0, 0, 1, -1};

bool in_maze(const Point next)
{
    return (next.x < N && next.x >= 0 && next.y < N && next.y >= 0 );
}

void _print(const Point q[], const Point cur)
{
    if (cur.last != -1)_print(q, q[cur.last]);
    printf("(%d, %d)\n", cur.x, cur.y);
}
int main()
{
    bool maze[N][N];
    //  read    maze
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            scanf("%d", &maze[i][j]);

    //  bfs
    bool visit[N][N];
    memset(visit, 0, sizeof(visit));

    Point q[N*N+2];
    int head = 1;
    int tail = 2;
    while (head < tail)
    {
        Point cur = q[head];
        for (int i = 0; i < 4; i++)
        {
            Point next(cur.x+ROW[i], cur.y+COL[i], head);
            if (next.x == 4 && next.y == 4)
            {
                _print(q, next);
                return 0;
            }
            else if (in_maze(next) && !maze[next.x][next.y] && !visit[next.x][next.y])
            {
                visit[next.x][next.y] = true;
                q[tail++] = next;
            }
        }
        head++;
    }
}