三遍堆优化spfa的思路，但是跑得很慢很慢TLE，改成dij也还是一样，求解？？？

//QwQcOrZ yyds!!!
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define N 1005
#define M 1005

using namespace std;

inline long long read(){
    long long x = 0; char ch = getchar(); bool positive = 1;
    for (; !isdigit(ch); ch = getchar())	if (ch == '-')	positive = 0;
    for (; isdigit(ch); ch = getchar())	x = x * 10 + ch - '0';
    return positive ? x : -x;
}
inline void write(long long a){
    if(a>=10)write(a/10);
    putchar('0'+a%10);
}
inline void writesp(long long a){
    if(a>=10)write(a/10);
    putchar('0'+a%10);
    printf(" ");
}
inline void writeln(long long a){
    if(a<0){
    	a=-a; putchar('-');
    }
    write(a); puts("");
}


int n,m,a,b,c,val[N][M],vis[N][M];

long long f[N][M],f1[N][M],f2[N][M],ans,d[5][3],xx,yy;

priority_queue<pair<long long,pair<int,int> > > q;

pair<int,int>now;

signed main()
{
    n=read(),m=read(),a=read(),b=read(),c=read();ans=0x3f3f3f3f3f3f3f3f3f3f;
    d[1][0]=0,d[1][1]=1,d[2][0]=1,d[2][1]=0,d[3][0]=0,d[3][1]=-1,d[4][0]=-1,d[4][1]=0;
    for (int i=1;i<=n;++i)
      for (int j=1;j<=m;++j)
        val[i][j]=read(),f[i][j]=0x3f3f3f3f3f3f3f3f3f3f,f1[i][j]=0x3f3f3f3f3f3f3f3f3f3f,f2[i][j]=0x3f3f3f3f3f3f3f3f3f3f;
    f[1][a]=0;
    q.push(make_pair(0,make_pair(1,a)));
    while (!q.empty())
    {
    	now=q.top().second;//cout<<now.first<<" "<<now.second<<endl;
    	q.pop();
    	vis[now.first][now.second]=0;
    	for (int i=1;i<=4;++i)
    	{
    		xx=now.first+d[i][0];
    		yy=now.second+d[i][1];
    		if (xx>=1&&xx<=n&&yy>=1&&yy<=m)
    		{
    			if (f[xx][yy]>f[now.first][now.second]+val[xx][yy])
    			{
    				f[xx][yy]=f[now.first][now.second]+val[xx][yy];
            		if (!vis[xx][yy]) q.push(make_pair(f[xx][yy],make_pair(xx,yy)));
            	}
            }
        }
    }
	f1[n][b]=0;
    q.push(make_pair(0,make_pair(n,b)));
    while (!q.empty())
    {
    	now=q.top().second;//cout<<now.first<<" "<<now.second<<endl;
    	q.pop();
    	vis[now.first][now.second]=0;
    	for (int i=1;i<=4;++i)
    	{
    		xx=now.first+d[i][0];
    		yy=now.second+d[i][1];
    		if (xx>=1&&xx<=n&&yy>=1&&yy<=m)
    		{
    			if (f1[xx][yy]>f1[now.first][now.second]+val[xx][yy])
    			{
    				f1[xx][yy]=f1[now.first][now.second]+val[xx][yy];
            		if (!vis[xx][yy]) q.push(make_pair(f1[xx][yy],make_pair(xx,yy)));
            	}
            }
        }
    }
    f2[n][c]=0;
    q.push(make_pair(0,make_pair(n,c)));
    while (!q.empty())
    {
    	now=q.top().second;//cout<<now.first<<" "<<now.second<<endl;
    	q.pop();
    	vis[now.first][now.second]=0;
    	for (int i=1;i<=4;++i)
    	{
    		xx=now.first+d[i][0];
    		yy=now.second+d[i][1];
    		if (xx>=1&&xx<=n&&yy>=1&&yy<=m)
    		{
    			if (f2[xx][yy]>f2[now.first][now.second]+val[xx][yy])
    			{
    				f2[xx][yy]=f2[now.first][now.second]+val[xx][yy];
            		if (!vis[xx][yy]) q.push(make_pair(f2[xx][yy],make_pair(xx,yy)));
            	}
            }
        }
    }
    for (int i=1;i<=n;++i)
      for (int j=1;j<=m;++j)
        ans=min(ans,f[i][j]-val[i][j]+val[1][a]+f1[i][j]-val[i][j]+val[n][b]+f2[i][j]+val[n][c]);
    cout<<ans<<endl;
    //writeln(f[3][3]);
    //writeln(f1[3][3]);
    //writeln(f2[3][3]);
}
/*
6 3 2 1 3
1 1 1
1 2 1
1 2 1
1 2 1
1 2 1
1 2 1

0 1 1
0 2 1
0 2 1
0 2 1
0 2 1
0 2 1

*/