代码如下

#include<vector>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
int n,m;
char maps[1000][1000];
vector<pair<int,int>> g[255000];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
int number[1000][1000];
char c[1000][1000];
int cnt;
int dx[4]={-1,0,1,0};
int dy[4]={0,1,0,-1};
long long d[255000];
bool vis[255000];
void getg(){//建图
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			int dic=0;
			if(c[i][j]=='X') continue;
			else if(c[i][j]=='N') dic=0;
			else if(c[i][j]=='E') dic=1;
			else if(c[i][j]=='S') dic=2;
			else dic=3;
			for(int k=0;k<4;k++){
				int xx=i+dx[k],yy=j+dy[k];
				g[number[i][j]].push_back(make_pair(number[xx][yy],(k-dic+4)%4));
			}
		}
	}
}
void debug(){
	for(int i=1;i<=n*m;i++){
		cout<<i<<endl;
		for(int j=0;j<g[i].size();j++){
			cout<<i<<" "<<g[i][j].first<<" "<<g[i][j].second<<" "<<endl;
		}
	}
}
void dijsktra(){
	memset(d,0x3f,sizeof d);
	d[1]=0;
	q.push({0,1});
	while(!q.empty()){
		pair<int,int> t=q.top();q.pop();
		if(vis[t.second]) continue;
		vis[t.second]=1;
		for(int i=0;i<g[t.second].size();i++){
			int y=g[t.second][i].first,w=g[t.second][i].second;
			if(d[y]>d[t.second]+w){
				d[y]=d[t.second]+w;
				q.push(make_pair(d[y],y));
			}
		}
	}
	
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cnt++;
			number[i][j]=cnt;
			cin>>c[i][j];
		}
	}
	getg();
	debug();
	dijsktra();
	if(d[n*m]==4557430888798830399) cout<<-1;
 	else cout<<d[n*m];
	return 0;
}