POJ - 3984 迷宫问题

原题链接：传送门

直接上代码（注：在原问题上加了输出具体走法）：

#include<iostream>
#include<queue>

using namespace std;
int n=5, m=5;
int mp[5][5] = {
	0, 1, 0, 0, 0,
	0, 1, 0, 1, 0,
	0, 0, 0, 0, 0,
	0, 1, 1, 1, 0,
	0, 0, 0, 1, 0,
};

int vis[10][10];
int dr[4][2] = {1, 0, 0, -1, 0, 1, -1, 0};
struct node {
    int x, y;
};
queue<node> q;
node pre[100][100];
vector<char> ops;

char get_op(node from, node to) {
    if ((from.x-to.x==0) && (from.y-to.y==1)) {
        return 'L';
    }
    if ((from.x-to.x==1) && (from.y-to.y==0)) {
        return 'U';
    }
    if ((from.x-to.x==0) && (from.y-to.y==-1)) {
        return 'R';
    }
    if ((from.x-to.x==-1) && (from.y-to.y==0)) {
        return 'D';
    }
    return 'F';
}
void bfs(int x, int y) {
    node nd1, nd2;
    nd1.x = x;nd1.y=y;
    q.push(nd1);
    vis[x][y] = 1;

    while(!q.empty()) {
        node u = q.front();q.pop();
        
        if(u.x == 0 && u.y == 0) {
            node tmp;
            while(!(u.x == n-1&&u.y == m-1)) {
                cout<<"("<<u.x<<", "<<u.y<<")"<<endl;
                tmp = u;
                u = pre[u.x][u.y];
                ops.push_back(get_op(tmp, u));
            }
            return;
        }

        for(int i=0;i<4;i++) {
            int nx = u.x + dr[i][0], ny = u.y + dr[i][1];
            if(((nx>=0&&nx<n) && (ny>=0&&ny<m)) && mp[nx][ny]!=1 && !vis[nx][ny]) {
                nd2.x = nx;nd2.y=ny;
                q.push(nd2);
                vis[u.x][u.y] = 1;
                pre[nx][ny] = u;
            }
        }
    }
}
int main()
{
    bfs(n-1, m-1);
    cout<<"(4, 4)"<<endl;
    /*
    这里加了输出每一步的具体方向
    */
    for(int i=0;i<ops.size();i++)
        cout<<ops[i];
    cout<<endl;
    return 0;
}