uva816 Abbott's Revenge

我知知道这题要用BFS，迷宫题，好难啊，我已无奈，苦苦坚持，~~~

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;
struct Node
{
    int r, c;
    int dir;
    Node(int rr=0, int cc=0, int ddir=0):r(rr), c(cc), dir(ddir) {}
};

const char* dirs = "NESW";
const char* turns = "FLR";
int dir_id(char c) { return strchr(dirs, c) - dirs; }
int turn_id(char c) { return strchr(turns, c) - turns; }
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
int d[10][10][4];
Node p[10][10][4];
int r0, c0, r1, dir, c1, r2, c2;
char name[100], c[100], s[100];
bool has_edge[10][10][4][3];

bool inside(int r, int c)
{
    return (r>=1 && r <= 9 && c >= 1 && c <= 9);
}

bool input()
{
    if(scanf("%s%d%d%s%d%d", name, &r0, &c0, &c, &r2, &c2) != 6) return false;
    printf("%s\n", name);
    dir = dir_id(c[0]);
    r1 = r0 + dr[dir];
    c1 = c0 + dc[dir];

    memset(has_edge, false, sizeof(has_edge));
    int a, b;
    while( scanf("%d", &a))
    {
        if(a == 0) break;
        scanf("%d", &b);
        while(scanf("%s", s))
        {
            if(s[0] == '*') break;
            int tempd = dir_id(s[0]);
            for(int i = 1; i < strlen(s); ++i)
                has_edge[a][b][tempd][turn_id(s[i])] = true;
        }
    }
    return true;
}
Node walk(const Node& u, int turn)
{
    int dir = u.dir;
    if(turn == 1) dir = (dir + 3) % 4;
    if(turn == 2) dir = (dir + 1) % 4;
    return Node(u.r + dr[dir], u.c + dc[dir], dir);
}

void print_ans(Node u)
{
    vector<Node> nodes;
    for(;;)
    {
        nodes.push_back(u);
        if(d[u.r][u.c][u.dir] == 0) break;
        u = p[u.r][u.c][u.dir];
    }
    nodes.push_back(Node(r0, c0, dir));

    int cnt = 0;
    for(int i = nodes.size()-1; i >= 0; --i)
    {
        if(cnt % 10 == 0) printf(" ");
        printf(" (%d,%d)",nodes[i].r, nodes[i].c);
        if(++cnt % 10 == 0) printf("\n");
    }
    if(nodes.size() % 10 != 0) printf("\n");
}

void solve()
{
    queue<Node> q;
    memset(d, -1, sizeof(d));
    Node u(r1, c1, dir);
    d[r1][c1][dir] = 0;
    q.push(u);
    while(!q.empty())
    {
        Node u = q.front(); q.pop();
        if(u.r == r2 && u.c == c2)
        {
            print_ans(u);
            return ;
        }
        for(int i = 0; i < 3; ++i)
        {
            Node v = walk(u, i);
            if(has_edge[u.r][u.c][u.dir][i] && inside(v.r, v.c) && d[v.r][v.c][v.dir] < 0)
            {
                d[v.r][v.c][v.dir] = d[u.r][u.c][u.dir] + 1;
                p[v.r][v.c][v.dir] = u;
                q.push(v);
            }
        }
    }
    puts("  No Solution Possible");
}
int main()
{
    while(input())
    {
        solve();
    }
    return 0;
}