#include using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(n);i++) #define rep1(i,n) for(int i=1;i<=(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(n);i>0;i--) #define REP(i,a,b) for(int i=a;i bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; #define Sp(p) cout<> h >> w; int sy, sx, gy, gx; cin >> sy >> sx; cin >> gy >> gx; vector s(h + 2, string(w + 2, '#')); rep1 (i, h) { string t; cin >> t; rep (j, w) { s[i][j + 1] = t[j]; } } vii dist(h + 2, vi(w + 2, inf)); dist[sy][sx] = 0; queue qu; qu.push(pii(sy, sx)); while (qu.size() > 0) { int y = qu.front().first, x = qu.front().second; qu.pop(); rep (k, 4) { int ny = y + dy[k], nx = x + dx[k]; if (s[ny][nx] == '#') continue; if (dist[ny][nx] == inf) { dist[ny][nx] = dist[y][x] + 1; qu.push(pii(ny, nx)); } } } cout << dist[gy][gx] << endl; }