POJ - 3984 迷宫问题(水BFS)

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int N = 10;

struct Node {
int x, y;
Node() {}
Node(int x, int y):x(x), y(y) {}
};

int map

;
int pathx

, pathy

;
bool vis

;
int dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};

void init() {
for (int i = 0; i < 5; i++)
for (int j = 0; j < 5; j++)
scanf("%d" ,&map[i][j]);
memset(vis, 0, sizeof(vis));
}

void bfs() {
queue<Node> Q;
Q.push(Node(0, 0));
vis[0][0] = 1;
while (!Q.empty()) {
Node t = Q.front(); Q.pop();
for (int i = 0; i < 4; i++) {
int x = t.x + dir[i][0];
int y = t.y + dir[i][1];
if (x < 0 || x >= 5 || y < 0 || y >= 5 || vis[x][y] || map[x][y]) continue;
pathx[x][y] = t.x;
pathy[x][y] = t.y;
vis[x][y] = 1;
Q.push(Node(x, y));
}
}
}

void out(int x, int y) {
if (x == 0 && y == 0) {
printf("(%d, %d)\n", x, y);
return ;
}
out(pathx[x][y], pathy[x][y]);
printf("(%d, %d)\n", x, y);
}

int main() {
init();
bfs();
out(4, 4);
return 0;
}