用BFS 求最短路（较复杂）

题目链接

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<vector>
#include<set>
#include<cmath>
#include<stack>
#include<map>
#include<queue>
#include<sstream>
using namespace std;
#define maxn 15
#define inf 0x3f3f3f3f
#define ll long long
#define mod 1000000007
const char * chao ="NESW";
const char * zuan ="LFR";
int dx[4]={
   -1,0,1,0};
int dy[4]={
   0,1,0,-1};
int nd[maxn][maxn];
int has_edge[maxn][maxn][4][3];
int d[maxn][maxn][4];
int n,m,e1,d1,fd;
char dir;
struct node
{
   
    int x,y,di;
};
node p[maxn][maxn][4];
int found(const char * ch