#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 using namespace std; using ll = long long; using P = pair; constexpr int INF = 1001001001; constexpr int mod = 1000000007; // constexpr int mod = 998244353; template inline bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template inline bool chmin(T& x, T y){ if(x > y){ x = y; return true; } return false; } constexpr int dx[4] = {1, 0, -1, 0}; constexpr int dy[4] = {0, 1, 0, -1}; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int h, w, sx, sy, tx, ty; cin >> h >> w >> sx >> sy >> tx >> ty; --sx, --sy, --tx, --ty; vector> grid(h, vector(w)); for(int i = 0; i < h; ++i){ for(int j = 0; j < w; ++j){ char ch; cin >> ch; grid[i][j] = ch - '0'; } } vector> used(h, vector(w)); queue

que; que.emplace(sx, sy); used[sx][sy] = true; while(!que.empty()){ auto [x, y] = que.front(); que.pop(); for(int i = 0; i < 4; ++i){ int nx = x + dx[i], ny = y + dy[i]; if(nx < 0 || nx >= h || ny < 0 || ny >= w) continue; if(!used[nx][ny] && abs(grid[nx][ny] - grid[x][y]) <= 1){ que.emplace(nx, ny); used[nx][ny] = true; } nx += dx[i], ny += dy[i]; if(nx < 0 || nx >= h || ny < 0 || ny >= w || used[nx][ny] || grid[nx][ny] != grid[x][y]) continue; que.emplace(nx, ny); used[nx][ny] = true; } } cout << (used[tx][ty] ? "YES\n" : "NO\n"); return 0; }