Abbott‘s Revenge

和紫书不一样的建图方式，记录一下

注意：当输出路径时，每行末尾是没有空格的。

#include<iostream>
#include<memory.h>
#include<queue>
#include<cstring>

using namespace std;
int arr[110][110][3];//从1到2后，下一个点的位置（F/L/R）
int pre[110][110];//路径的前序节点
int visit[110][110];//记录路径是否走过

const char* dirs="NESW";
const char* turns="FLR";
int dir_id(char c){return strchr(dirs,c)-dirs; }
int dr[]={-1,0,1,0};
int dc[]={0,1,0,-1};

int start,goal;
char direct;
void draw_map(){
    int x,y;
    cin>>x>>y;
    start=x*10+y;
    cin>>direct;
    cin>>x>>y;
    goal=x*10+y;
    string s;
    while (cin>>x&&x){
        cin>>y;
        int m1,m2;
        while (cin>>s&&s!="*"){
            m1=dr[(dir_id(s[0])+2)%4];
            m2=dc[(dir_id(s[0])+2)%4];
            for (int i = 1; i <s.length(); ++i) {
                if (s[i] == 'F')
                    arr[(x+m1)*10+(y+m2)][x*10+y][0]=(x-m1)*10+(y-m2);
                else if(s[i] == 'R'){
                    if(s[0]=='N'||s[0]=='S')
                        arr[(x+m1)*10+(y+m2)][x*10+y][1]=(x+m2)*10+(y+m1);
                    else
                        arr[(x+m1)*10+(y+m2)][x*10+y][1]=(x-m2)*10+(y+m1);
                }
                else if(s[i]=='L')
                    if(s[0]=='N'||s[0]=='S')
                        arr[(x+m1)*10+(y+m2)][x*10+y][2]=(x+m2)*10+(y-m1);
                    else
                        arr[(x+m1)*10+(y+m2)][x*10+y][2]=(x+m2)*10+(y+m1);

            }
        }
    }
}
int bfs(){
    queue<pair<int,int>>q;
    int m1=dr[dir_id(direct)],m2=dc[dir_id(direct)];
    int x=start/10,y=start%10;
    if((x+m1)*10+(y+m2)==goal)//出发点直接到终点
        return -1;
    q.push(pair(start,(x+m1)*10+(y+m2)));
    visit[start][(x+m1)*10+(y+m2)]=1;
    pre[start][(x+m1)*10+(y+m2)]=-1;
    while (!q.empty()){
        int in=q.front().first,out=q.front().second;
        q.pop();
        for (int i = 0; i < 3; ++i) {
            if(arr[in][out][i]!=0)
            {
                if(visit[out][arr[in][out][i]]==0)//这条路径未经过
                {
                    visit[out][arr[in][out][i]]=1;
                    pre[out][arr[in][out][i]]=in;
                    if(arr[in][out][i]==goal) return out;
                    q.push(pair(out, arr[in][out][i]));
                }
            }
        }
    }
    return 0;
}

void print_ans(int flag){
    vector<int>v;
    v.push_back(goal);
    v.push_back(flag);
    int a=flag,b=goal;
    while (pre[a][b]!=-1){
        v.push_back((pre[a][b]));
        b=a;
        a=v.back();
    }
    int cnt=0;
    for (int i = v.size()-1; i >=0; i--) {//每行末尾没有空格
        if(cnt%10==0)printf(" ");
        printf(" (%d,%d)",v[i]/10,v[i]%10);
        if(++cnt%10==0)printf("\n");
    }
    if(v.size()%10!=0)printf("\n");
}
int main(){
    string name;
    while (cin>>name&&name!="END"){
        memset(arr,0,sizeof(arr));
        memset(pre,0,sizeof(pre));
        memset(visit,0,sizeof(visit));
        draw_map();
        int flag=bfs();
        cout<<name<<endl;
        if(!flag)
            printf("  No Solution Possible\n");
        else if(-1==flag)
            printf("  (%d,%d) (%d,%d)\n",start/10,start%10,goal/10,goal%10);
        else
            print_ans(flag);
    }
    return 0;
}