#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { std::cin >> t; } templatevoid Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); } #define OUT(d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i=ll(a);--i) #define REPLL(i, n) for(ll i=0;i=0;--i) #define PAIR std::pair #define PAIRLL std::pair #define IN(a, x, b) (a<=x && x(end-start).count();std::cerr<<"[Time:"< tmp(a);std::cout << #a << "\t:";for(int i=0; i(a.size()); ++i){std::cout << tmp.front() << "\n";tmp.pop();}std::cout << "\n";} #define CHMAX(a, b) a = (((a)<(b)) ? (b) : (a)) #define CHMIN(a, b) a = (((a)>(b)) ? (b) : (a)) #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} //#define int ll using ll = long long; using ull = unsigned long long; constexpr int INFINT = 1 << 30; constexpr ll INFLL = 1LL << 60; constexpr double EPS = 0.0000000001; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238; int dy[] = { -1, 0, 1, 0 }; int dx[] = { 0, 1, 0, -1 }; signed main() { INIT; VAR(int, h, w); VAR(int, sx, sy, gx, gy); --sx; --sy; --gx; --gy; MAT(char, m, h, w); std::vector> visited(h, std::vector(w, false)); std::function dfs = [&](int y, int x) { visited[y][x] = true; REP(i, 4) { int Y = y + dy[i]; int X = x + dx[i]; if (!IN(0, Y, h) || !IN(0, X, w)) continue; if (visited[Y][X]) continue; if (std::abs(m[Y][X] - m[y][x]) > 1) continue; dfs(Y, X); } REP(i, 4) { int Y = y + 2*dy[i]; int X = x + 2*dx[i]; if (!IN(0, Y, h) || !IN(0, X, w)) continue; if (visited[Y][X]) continue; if (std::abs(m[Y][X] - m[y][x]) > 0) continue; dfs(Y, X); } }; dfs(sx, sy); if (visited[gx][gy]) { OUT("YES")BR; } else { OUT("NO")BR; } return 0; }