Problem:
Score : 400 points

Problem Statement

A maze is composed of a grid of H \times W squares - H vertical, W horizontal.

The square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..

There is a magician in (C_h,C_w). He can do the following two kinds of moves:

Move A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.

Move B: Use magic to warp himself to a road square in the 5\times 5 area centered at the square he is currently in.

In either case, he cannot go out of the maze.

At least how many times does he need to use the magic to reach (D_h, D_w)?

Constraints

1 \leq H,W \leq 10^3

1 \leq C_h,D_h \leq H

1 \leq C_w,D_w \leq W

S_{ij} is # or ..

S_{C_h C_w} and S_{D_h D_w} are ..

(C_h,C_w) \neq (D_h,D_w)

Input

Input is given from Standard Input in the following format:

H W
C_h C_w
D_h D_w
S_{11}\ldots S_{1W}
\vdots
S_{H1}\ldots S_{HW}

Output

Print the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.

Sample Input 1

4 4
1 1
4 4
..#.
..#.
.#..
.#..

Sample Output 1

1

For example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.

Note that he cannot walk diagonally.

Sample Input 2

4 4
1 4
4 1
.##.
####
####
.##.

Sample Output 2

-1

He cannot move from there.

Sample Input 3

4 4
2 2
3 3
....
....
....
....

Sample Output 3

0

No use of magic is needed.

Sample Input 4

4 5
1 2
2 5
#.###
####.
#..##
#..##

Sample Output 4

2

Solution in C++ (GCC 9.2.1) (judge verdict: Time Limit Exceeded)

#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

ll h,w;
ll ch,cw;
ll dh,dw;
vector<string> s(1001);


bool check(ll x, ll y){
    if(x < 0 || x >= h) return false;
    if(y < 0 || y >= w) return false;
    if(s[x][y] == '#')  return false;

    return true;
};



int main(){
    cin >> h >> w;
    cin >> ch >> cw;
    cin >> dh >> dw;
    ll count = 0;

    vector<vector<ll>> d(h,vector<ll>(w,MAX));

    rep(i,h) {
        cin  >> s[i];
    }

    pair<ll,ll> pos = make_pair(ch-1,cw-1);
    pair<ll,ll> dest = make_pair(dh-1,dw-1);
    d[ch-1][cw-1] = 0;

    queue<pair<ll,ll>> q;
    q.push(pos);

    int dx[4] = {0,1,0,-1};
    int dy[4] = {1,0,-1,0};

    int lx[20] = {-1,1,-1,1,-2,-1,0,1,2,-2,2,-2,2,-2,2,-2,-1,0,1,2};
    int ly[20] = {1,1,-1,-1,2,2,2,2,2,1,1,0,0,-1,-1,-2,-2,-2,-2,-2};

    //int lx[4] = {-1,1,-1,1,-2,-1,0,1,2,-2,2,-2,2,-2,2,-2,-1,0,1,2};
    //int ly[4] = {1,1,-1,-1,2,2,2,2,2,1,1,0,0,-1,-1,-2,-2,-2,-2,-2};


    while(!q.empty()){


        pos = q.front();
        q.pop();

        //bool flag = false;


        rep(k,4){
            count ++;
            if(check(pos.first + dx[k],pos.second + dy[k])){
                if(d[pos.first][pos.second] < d[pos.first + dx[k]][pos.second + dy[k]]){
                    d[pos.first + dx[k]][pos.second + dy[k]] = d[pos.first][pos.second];
                    q.push(make_pair(pos.first+dx[k],pos.second+dy[k]));
                    //flag = true;
                }
            }
        }

        //if(h*w < 1000000) flag = false;
        rep(k, 20) {
            count ++;
            if (check(pos.first + lx[k], pos.second + ly[k])) {
                if (d[pos.first][pos.second] + 1 < d[pos.first + lx[k]][pos.second + ly[k]]) {
                    d[pos.first + lx[k]][pos.second + ly[k]] = d[pos.first][pos.second] + 1;
                    q.push(make_pair(pos.first + lx[k], pos.second + ly[k]));
                }
            }
        }

        if(count > 900000000) break;

    }

    if(d[dest.first][dest.second] == MAX) cout << -1;
    else cout << d[dest.first][dest.second];


}