为啥不能倒过来输入

#include<bits/stdc++.h>
#define int long long
#define N 1010
using namespace std;
int s[N][N],n,m,a,b,c,minn=-1;
int d[3][N][N],vis[3][N][N];
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
struct node{
	int x;
	int y;
	int r;
	bool operator<(const node &t) const{
		return r>t.r;
	}
};
void dijkstra(int x,int y,int t){
	priority_queue<node>q;
	q.push({x,y,0});
	d[t][x][y]=s[x][y];
	while(!q.empty()){
		auto now=q.top();
		q.pop();
		int x=now.x;
		int y=now.y;
		if(vis[t][x][y]) continue;
		vis[t][x][y]=1;
		for(int i=0;i<4;i++){
			int sx=x+dx[i];
			int sy=y+dy[i];
			int sr=s[sx][sy];
			if(sx<1||sy<1||sx>n||sy>m) continue;
			if(d[t][sx][sy]==-1||d[t][sx][sy]>d[t][x][y]+sr){
				d[t][sx][sy]=d[t][x][y]+sr;
				q.push({sx,sy,d[t][sx][sy]});
			}
		}
	}
}
signed main(){
	cin>>n>>m>>a>>b>>c;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s[i][j];
		}
	}
	memset(d,-1,sizeof d);
	dijkstra(1,a,0);
	dijkstra(n,b,1);
	dijkstra(n,c,2);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			minn=min(minn,d[0][i][j]+d[1][i][j]+d[2][i][j]-s[i][j]*2);
			if(minn==-1) minn=d[0][i][j]+d[1][i][j]+d[2][i][j];
		}
	}
	cout<<minn;
	return 0;
}

#include<bits/stdc++.h>
#define int long long
#define N 1010
using namespace std;
int s[N][N],n,m,a,b,c,minn=-1;
int d[3][N][N],vis[3][N][N];
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
struct node{
	int x;
	int y;
	int r;
	bool operator<(const node &t) const{
		return r>t.r;
	}
};
void dijkstra(int x,int y,int t){
	priority_queue<node>q;
	q.push({x,y,0});
	d[t][x][y]=s[x][y];
	while(!q.empty()){
		auto now=q.top();
		q.pop();
		int x=now.x;
		int y=now.y;
		if(vis[t][x][y]) continue;
		vis[t][x][y]=1;
		for(int i=0;i<4;i++){
			int sx=x+dx[i];
			int sy=y+dy[i];
			int sr=s[sx][sy];
			if(sx<1||sy<1||sx>n||sy>m) continue;
			if(d[t][sx][sy]==-1||d[t][sx][sy]>d[t][x][y]+sr){
				d[t][sx][sy]=d[t][x][y]+sr;
				q.push({sx,sy,d[t][sx][sy]});
			}
		}
	}
}
signed main(){
	cin>>n>>m>>a>>b>>c;
	for(int i=n;i>=1;i--){
		for(int j=1;j<=m;j++){
			cin>>s[i][j];
		}
	}
	memset(d,-1,sizeof d);
	dijkstra(n,a,0);
	dijkstra(1,b,1);
	dijkstra(1,c,2);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			minn=min(minn,d[0][i][j]+d[1][i][j]+d[2][i][j]-s[i][j]*2);
			if(minn==-1) minn=d[0][i][j]+d[1][i][j]+d[2][i][j];
		}
	}
	cout<<minn;
	return 0;
}