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 Rust (1.42.0) (judge verdict: Wrong Answer)

// -*- coding:utf-8-unix -*-

#[macro_use]
extern crate lazy_static;
extern crate num_bigint; // 0.2.2
extern crate num_traits; // 0.2.8
use num_bigint::BigInt;
use num_traits::Pow;

// use proconio::derive_readable;
use proconio::fastout;
use proconio::input;
// use std::convert::TryInto;
use libm::*;
use std::cmp::*;
use std::collections::{BinaryHeap, HashMap, HashSet, VecDeque};
use std::io::*;
use std::ops::Range;
use std::str::FromStr;
use superslice::*;

use lazy_static::lazy_static;
use std::sync::Mutex;

pub fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

const can_move: [(i32, i32); 20] = [
    (-2, -2),
    (-2, -1),
    (-2, 0),
    (-2, 1),
    (-2, 2),
    (-1, -2),
    (-1, -1),
    (-1, 1),
    (-1, 2),
    (0, -2),
    (0, 2),
    (1, -2),
    (1, -1),
    (1, 1),
    (1, 2),
    (2, -2),
    (2, -1),
    (2, 0),
    (2, 1),
    (2, 2),
];

lazy_static! {
    static ref H: Mutex<Vec<i32>> = Mutex::default();
    static ref W: Mutex<Vec<i32>> = Mutex::default();
}

//abc176-D
// #[fastout]
fn main() {
    input![
        h: usize,
        w: usize,
        ch: usize,
        cw: usize,
        dH: usize,
        dW: usize,
        s: [String; h]
    ];

    let ch = ch - 1;
    let cw = cw - 1;
    let dH = dH - 1;
    let dW = dW - 1;

    let mut dp = vec![vec![std::i32::MAX - 2; w]; h];
    dp[dH][dW] = 0;
    let mut is_visit = vec![vec![false; w]; h];

    // let ans = std::thread::Builder::new()
    //     .name("big stack size".into())
    //     .stack_size(32 * 1024 * 1024) // 32 MBのスタックサイズ
    //     // .stack_size(1024 * 100) // 32 MBのスタックサイズ
    //     .spawn(move || {
    //         // ここで深い再帰を実行
    //         go(ch, cw, &mut dp, &mut is_visit, h, w, &s, (10000, 10000))
    //     })
    //     .unwrap()
    //     .join()
    //     .unwrap();

    let ans = go(ch, cw, &mut dp, &mut is_visit, h, w, &s, (10000, 10000));

    // println!("{:?}", s);

    println!(
        "{}",
        if ans == (std::i32::MAX - 2) as usize {
            -1
        } else {
            ans as i32
        }
    );
}

fn go(
    hh: usize,
    ww: usize,
    dp: &mut Vec<Vec<i32>>,
    is_visit: &mut Vec<Vec<bool>>,
    h: usize,
    w: usize,
    s: &Vec<String>,
    before: (usize, usize),
) -> usize {
    // eprintln!("{}, {}, {:?}", hh, ww, is_visit);

    if dp[hh][ww] < std::i32::MAX - 2 {
        return dp[hh][ww] as usize;
    }

    let mut min_magic = std::usize::MAX - 2;
    // let mut is_visit = is_visit.clone();
    is_visit[hh][ww] = true;

    let walk: [(i32, i32); 4] = [(-1, 0), (0, -1), (0, 1), (1, 0)];

    for (del_h, del_w) in walk.iter() {
        if hh as i32 + del_h < 0
            || hh as i32 + del_h >= h as i32
            || ww as i32 + del_w < 0
            || ww as i32 + del_w >= w as i32
        {
            continue;
        }

        let new_h = (hh as i32 + del_h) as usize;
        let new_w = (ww as i32 + del_w) as usize;

        if s[new_h].chars().nth(new_w).unwrap() == '#' || is_visit[new_h][new_w] {
            // if s[new_h].chars().nth(new_w).unwrap() == '#' || before == (new_w, new_w) {
            continue;
        }

        min_magic = min(
            min_magic,
            go(
                (hh as i32 + del_h) as usize,
                (ww as i32 + del_w) as usize,
                dp,
                // &mut is_visit,
                is_visit,
                h,
                w,
                s,
                (new_h, new_w),
            ),
        )
    }

    for (del_h, del_w) in can_move.iter() {
        if hh as i32 + del_h < 0
            || hh as i32 + del_h >= h as i32
            || ww as i32 + del_w < 0
            || ww as i32 + del_w >= w as i32
        {
            continue;
        }

        let new_h = (hh as i32 + del_h) as usize;
        let new_w = (ww as i32 + del_w) as usize;

        // eprintln!(
        //     "{}, {}, {}, {}, {}, {:?}",
        //     h,
        //     new_h,
        //     w,
        //     new_w,
        //     ww as i32 + del_w,
        //     s[new_h].chars().nth(new_w)
        // );
        // eprintln!("{}", is_visit[new_h][new_w]);
        if s[new_h].chars().nth(new_w).unwrap() == '#' || is_visit[new_h][new_w] {
            // if s[new_h].chars().nth(new_w).unwrap() == '#' || before == (new_w, new_w) {
            continue;
        }

        min_magic = min(
            min_magic,
            go(
                (hh as i32 + del_h) as usize,
                (ww as i32 + del_w) as usize,
                dp,
                // &mut is_visit,
                is_visit,
                h,
                w,
                s,
                (new_h, new_w),
            ) + 1,
        );
    }

    dp[hh][ww] = min_magic as i32;
    // eprintln!("{}, {}, {}", hh, ww, dp[hh][ww].unwrap());
    is_visit[hh][ww] = false;

    return min_magic;
}

// let mut values = VALUES.lock().unwrap();
// values.extend_from_slice(&[1, 2, 3, 4]);
// assert_eq!(&*values, &[1, 2, 3, 4]);

// -100000000
//  1000000000