ソースコード
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define REPW(i,n) for(i=0;i<(int)(n);++i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
ITR(i,v) os << *i << (i==end(v)-1 ? "" : "\n"); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
is >> p.first >> p.second; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
struct before_main_function {
before_main_function() {
#ifdef int
#undef INF
#define INF INFLL
#define stoi stoll
#endif
cin.tie(0);ios::sync_with_stdio(false);
cout<<setprecision(15)<<fixed;
}
} before_main_function;
//------------------8<------------------------------------8<--------------------
signed main() {
int H,W,gy,gx,t,b,l,r;
cin>>H>>W>>gy>>gx;
gy--,gx--;
vector<int>Y(H),X(W);
cin>>Y>>X>>t>>b>>l>>r;
t--,b--,l--,r--;
vector<vector<int>> dist(H,vector<int>(W,INF));
priority_queue<pair<int,pii>,vector<pair<int,pii>>,greater<pair<int,pii>>> pq;
dist[0][0]=0;
pq.push({0,{0,0}});
while(!pq.empty()) {
int d=pq.top().first;
int y=pq.top().second.first;
int x=pq.top().second.second;
pq.pop();
REP(dir,4) {
int yy=y+DY[dir];
int xx=x+DX[dir];
if(OUTOFRANGE(yy,xx,H,W)) continue;
if(t<=yy && yy<=b && l<=xx && xx<=r) continue;
int cost=0;
if(dir==0 || dir==2) cost=X[x];
if(dir==1 || dir==3) cost=Y[y];
if(chmin(dist[yy][xx],d+cost)) {
pq.push({d+cost,{yy,xx}});
}
}
}
cout<<(dist[gy][gx]==INF?-1:dist[gy][gx])<<endl;
return 0;
}