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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.awt.Point;
import java.util.ArrayDeque;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int h = sc.nextInt();
		int w = sc.nextInt();
		sc.nextLine();
		int ch = sc.nextInt() -1;
		int  cw = sc.nextInt() -1;
		sc.nextLine();
		int dh = sc.nextInt() -1;
		int dw = sc.nextInt() -1;
		Point start = new Point(cw, ch);
		Point goal = new Point(dw, dh);
		// 迷路
		char[][] area = new char[h][w];
		for (int i = 0; i < h; i++) {
			sc.nextLine();
			char[] tmp = sc.next().toCharArray();
			for (int j = 0; j < tmp.length; j++) {
				area[i][j] = tmp[j];
			}
		}
		// キューを用意し、スタート地点をセット
		ArrayDeque<Point> dq = new ArrayDeque<>();
		dq.add(start);
		Point[] D4 = {new Point(0, 1), new Point(-1, 0), new Point(0, -1), new Point(1, 0)};
		Point[] J24 = {new Point(0, 1), new Point(-1, 0), new Point(0, -1), new Point(1, 0)
								, new Point(1, 1), new Point(-1, 1), new Point(1, -1), new Point(1, -1)
								, new Point(2, -2), new Point(2, -1), new Point(2, 0), new Point(2, 1)
								, new Point(2, 2), new Point(1, -2), new Point(1, 2), new Point(0, -2)
								, new Point(0, 2), new Point(-1, -2), new Point(-1, 2), new Point(-2, -2)
								, new Point(-2, -1), new Point(-2, 0), new Point(-2, 1), new Point(-2, 2)};
		ArrayDeque<Point> zeroDq = new ArrayDeque<>();
		zeroDq.add(start);
		
		int  cost = 0;
		//幅優先探索
		outer : while (true) {
			while (dq.size() > 0) {
				// コスト0で移動できる範囲をzeroDqに格納していく
				// 先頭キューを現在位置とする
				Point p = dq.removeFirst();
				for (int i = 0; i < 4; i++) {
					// 上下左右を確認・動けるマスをキューに追加
					int x = (int)(p.getX() + D4[i].getX());
					if (x > w - 1 || x < 0) continue;
					int y = (int)(p.getY()+D4[i].getY());
					if (y > h - 1 || y < 0) continue;
					if (area[y][x] == '.') {
						dq.addLast(new Point(x, y));
						zeroDq.add(new Point(x, y));
						if (zeroDq.contains(goal)) {
							break outer;
						}
						// 到達可能マスは壁に
						area[y][x] = '#';
					}
				}
			}
			cost = cost + 1;
			// 移動B到達範囲を探索
			while (zeroDq.size() > 0) {
				Point p = zeroDq.removeFirst();
				for (int i = 0; i < 24; i++) {
					// 上下左右を確認・動ける未踏マスをキューに追加
					int x = (int)(p.getX() + J24[i].getX());
					if (x > w - 1 || x < 0) continue;
					int y = (int)(p.getY()+J24[i].getY());
					if (y > h - 1 || y < 0) continue;
					if (area[y][x] == '.') {
						dq.addLast(new Point(x, y));
						area[y][x] = '#';
					}
				}
			}
			if (dq.contains(goal)) break;
			if (dq.isEmpty()) {
				// 到達不能
				cost = -1;
				break outer;
			}
		}
		System.out.println(cost);
	}
	
}