#line 2 "/home/sakflat/CP/_library/cpp/template/template.cpp" //yukicoder@cpp17 #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using P = pair; const ll MOD = 998244353; const ll MODx = 1000000007; const int INF = (1<<30)-1; const ll LINF = (1LL<<62LL)-1; const double EPS = (1e-10); P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}}; P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}}; template vector make_vector(size_t a, T b) { return vector(a, b); } template auto make_vector(size_t a, Ts... ts) { return vector(a, make_vector(ts...)); } /* 確認ポイント cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる 計算量は変わらないが楽できるシリーズ min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる */ /* comment outed because can cause bugs __attribute__((constructor)) void initial() { cin.tie(0); ios::sync_with_stdio(false); } */ #line 2 "/home/sakflat/CP/_library/cpp/template/basic.cpp" #line 1 "/home/sakflat/CP/_library/cpp/graph/shortest-path/dijkstra.cpp" template class dijkstra{ struct vg{ int t; T c; }; vector> cost; int beg = -1; void run(int x){ auto comp = [](vg a,vg b){ return a.c>b.c; }; priority_queue,decltype(comp)> R{comp}; for(int i = 0; n > i; i++){ cost[i].second = -1; } cost[x].first = -1; cost[x].second = 0; R.push({x,0}); while(R.size()){ auto k = R.top();R.pop(); if(cost[k.t].second != k.c)continue; for(int i = 0; A[k.t].size() > i; i++){ if(cost[A[k.t][i].t].second != -1 && cost[A[k.t][i].t].second <= k.c+A[k.t][i].c)continue; cost[A[k.t][i].t].second = k.c+A[k.t][i].c; cost[A[k.t][i].t].first = k.t; R.push({A[k.t][i].t,k.c+A[k.t][i].c}); } } } public: int n; vector> A; vector> Rev; dijkstra(int n_):n(n_),A(n_),Rev(n_),cost(n_,{-1,-1}){} //双方向 void push(int s,int v,T c){ A[s].push_back({v,c}); A[v].push_back({s,c}); Rev[s].push_back({v,c}); Rev[v].push_back({s,c}); } void push_side(int s,int v,T c){ A[s].push_back({v,c}); Rev[v].push_back({s,c}); } void build(int x){ run(x); beg = x; } //restorate any vector restoration(int t = -1){ vector Ret; if(beg == -1 || (t != -1 && cost[t].second == -1)){ Ret.push_back(-1); return Ret; } int ind = t; if(ind == -1){ T tmp = cost[0].second; int tmpin = 0; for(int i = 0; n > i; i++){ if(tmp < cost[i].second){ tmp = cost[i].second; tmpin = i; } } ind = tmpin; } Ret.push_back(ind); while(beg != ind){ Ret.push_back({cost[ind].first}); ind = cost[ind].first; } reverse(Ret.begin(),Ret.end()); return Ret; } T operator[](int i){ return cost[i].second; } }; int main(){ int n,v,ox,oy;cin>>n>>v>>ox>>oy; vector> A(n, vector(n,0)); for(int i = 0; n > i; i++){ for(int j = 0; n > j; j++){ cin>>A[i][j]; } } v -= A[0][0]; dijkstra D(n*n); for(int i = 0; n > i; i++){ for(int j = 0; n > j; j++){ if(j+1 != n)D.push(i*n+j, i*n+j+1, A[i][j+1]); if(i+1 != n)D.push(i*n+j, (i+1)*n+j, A[i+1][j]); } } D.build(0); if(D[n*n-1] < v){ cout << "YES" << endl; }else if(ox != -1){ if(D[ox*n+oy] < v){ long long cur = (v-D[ox*n+oy])*2; D.build(ox*n+oy); if(D[n*n-1] < cur){ cout << "YES" << endl; }else{ cout << "NO" << endl; } }else{ cout << "NO" << endl; } } return 0; }