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



Sample input:
4 4
1 1
4 4
..#.
..#.
.#..
.#..


Sample output:
1

Submission status: Wrong Answer

Solution code:
from collections import deque

h, w = map(int, input().split())
Ch, Cw = map(int, input().split())
Dh, Dw = map(int, input().split())
Ch -= 1
Cw -= 1
Dh -= 1
Dw -= 1
t = [[i for i in range(w)] for j in range(h)]
ans = 0
for i in range(h):
  temp = input()
  for j in range(w):
    t[i][j] = temp[j]

d = deque([(Ch, Cw)])
ans = 0
s = set() # いったところ
a = [(1,0),(-1,0),(0,1),(0,-1)]
b = [-2, -1, 0, 1, 2]

while True:
  # 移動A
  while d != deque():
    Th, Tw = d.popleft()
    s.add((Th, Tw))
    if (Th,Tw) == (Dh, Dw):
      print(ans)
      exit()
    for i, j in a:
      _h = Th + i
      _w = Tw + j
      _p = (_h, _w)
      if (not (_p) in s) and _h >= 0 and _h < h and _w >= 0 and _w < w and t[_h][_w] == '.':
        d.append(_p)
  # 移動B
  ans += 1
  for i in b:
    for j in b:
      _h = Th + i
      _w = Tw + j
      _p = (_h, _w)
      if (not (_p) in s) and _h >= 0 and _h < h and _w >= 0 and _w < w and t[_h][_w] == '.':
        d.append(_p)
  if len(d) == 0:
    print('-1')
    exit()

Submission status: Wrong Answer

Solution code:
def main():
    from collections import deque

    h, w = map(int, input().split())
    ch, cw = map(lambda x: int(x) - 1, input().split())
    dh, dw = map(lambda x: int(x) - 1, input().split())

    m = [list(input()) for _ in range(h)]
    vis = [[False for _ in range(w + 2)] for _ in range(h + 2)]

    def walk(i, j):
        q = deque()
        q.append((i, j))
        edge = []
        while q:
            y, x = q.popleft()
            if vis[y][x]:
                continue
            vis[y][x] = True
            for s, t in [(1, 0), (0, 1), (-1, 0), (0, -1)]:
                if not 0 <= y + s <= h - 1 or not 0 <= x + t <= w - 1:
                    continue
                if m[y + s][x + t] == '#':
                    edge.append((y, x))
                    continue
                q.appendleft((y + s, x + t))
        return edge

    def jump(i, j, c):
        q = walk(i, j)
        if (dh, dw) in q:
            return c
        nx = []
        c += 1
        while q:
            y, x = q.pop()
            for s in range(-2, 3):
                for t in range(-2, 3):
                    if not 0 <= y + s <= h - 1 or not 0 <= x + t <= w - 1:
                        continue
                    if vis[y + s][x + t]:
                        continue
                    if m[y + s][x + t] == '#':
                        continue
                    nx += walk(y + s, x + t)
            if (dh, dw) in nx:
                return c
            if len(q) == 0:
                c += 1
                q = nx
                nx = []

    ans = jump(ch, cw, 0)
    print(ans if ans is not None else -1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
mod = 10 ** 9 + 7
mod1 = 998244353
#setrecursionlimit(300000)
# ------------------------------warmup----------------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
#sys.setrecursionlimit(300000)
class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")


# -------------------game starts now----------------------------------------------------import math
class SegmentTree:
    def __init__(self, data, default=0, func=lambda a, b: a + b):
        """initialize the segment tree with data"""
        self._default = default
        self._func = func
        self._len = len(data)
        self._size = _size = 1 << (self._len - 1).bit_length()

        self.data = [default] * (2 * _size)
        self.data[_size:_size + self._len] = data
        for i in reversed(range(_size)):
            self.data[i] = func(self.data[i + i], self.data[i + i + 1])

    def __delitem__(self, idx):
        self[idx] = self._default

    def __getitem__(self, idx):
        return self.data[idx + self._size]

    def __setitem__(self, idx, value):
        idx += self._size
        self.data[idx] = value
        idx >>= 1
        while idx:
            self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
            idx >>= 1

    def __len__(self):
        return self._len

    def query(self, start, stop):
        if start == stop:
            return self.__getitem__(start)
        stop += 1
        start += self._size
        stop += self._size

        res = self._default
        while start < stop:
            if start & 1:
                res = self._func(res, self.data[start])
                start += 1
            if stop & 1:
                stop -= 1
                res = self._func(res, self.data[stop])
            start >>= 1
            stop >>= 1
        return res

    def __repr__(self):
        return "SegmentTree({0})".format(self.data)


# -------------------------------iye ha chutiya zindegi-------------------------------------
class Factorial:
    def __init__(self, MOD):
        self.MOD = MOD
        self.factorials = [1, 1]
        self.invModulos = [0, 1]
        self.invFactorial_ = [1, 1]

    def calc(self, n):
        if n <= -1:
            print("Invalid argument to calculate n!")
            print("n must be non-negative value. But the argument was " + str(n))
            exit()
        if n < len(self.factorials):
            return self.factorials[n]
        nextArr = [0] * (n + 1 - len(self.factorials))
        initialI = len(self.factorials)
        prev = self.factorials[-1]
        m = self.MOD
        for i in range(initialI, n + 1):
            prev = nextArr[i - initialI] = prev * i % m
        self.factorials += nextArr
        return self.factorials[n]

    def inv(self, n):
        if n <= -1:
            print("Invalid argument to calculate n^(-1)")
            print("n must be non-negative value. But the argument was " + str(n))
            exit()
        p = self.MOD
        pi = n % p
        if pi < len(self.invModulos):
            return self.invModulos[pi]
        nextArr = [0] * (n + 1 - len(self.invModulos))
        initialI = len(self.invModulos)
        for i in range(initialI, min(p, n + 1)):
            next = -self.invModulos[p % i] * (p // i) % p
            self.invModulos.append(next)
        return self.invModulos[pi]

    def invFactorial(self, n):
        if n <= -1:
            print("Invalid argument to calculate (n^(-1))!")
            print("n must be non-negative value. But the argument was " + str(n))
            exit()
        if n < len(self.invFactorial_):
            return self.invFactorial_[n]
        self.inv(n)  # To make sure already calculated n^-1
        nextArr = [0] * (n + 1 - len(self.invFactorial_))
        initialI = len(self.invFactorial_)
        prev = self.invFactorial_[-1]
        p = self.MOD
        for i in range(initialI, n + 1):
            prev = nextArr[i - initialI] = (prev * self.invModulos[i % p]) % p
        self.invFactorial_ += nextArr
        return self.invFactorial_[n]


class Combination:
    def __init__(self, MOD):
        self.MOD = MOD
        self.factorial = Factorial(MOD)

    def ncr(self, n, k):
        if k < 0 or n < k:
            return 0
        k = min(k, n - k)
        f = self.factorial
        return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD


# --------------------------------------iye ha combinations ka zindegi---------------------------------
def powm(a, n, m):
    if a == 1 or n == 0:
        return 1
    if n % 2 == 0:
        s = powm(a, n // 2, m)
        return s * s % m
    else:
        return a * powm(a, n - 1, m) % m


# --------------------------------------iye ha power ka zindegi---------------------------------
def sort_list(list1, list2):
    zipped_pairs = zip(list2, list1)

    z = [x for _, x in sorted(zipped_pairs)]

    return z


# --------------------------------------------------product----------------------------------------
def product(l):
    por = 1
    for i in range(len(l)):
        por *= l[i]
    return por


# --------------------------------------------------binary----------------------------------------
def binarySearchCount(arr, n, key):
    left = 0
    right = n - 1

    count = 0

    while (left <= right):
        mid = int((right + left) / 2)

        # Check if middle element is
        # less than or equal to key
        if (arr[mid] < key):
            count = mid + 1
            left = mid + 1

        # If key is smaller, ignore right half
        else:
            right = mid - 1

    return count


# --------------------------------------------------binary----------------------------------------
def countdig(n):
    c = 0
    while (n > 0):
        n //= 10
        c += 1
    return c
def binary(x, length):
    y = bin(x)[2:]
    return y if len(y) >= length else "0" * (length - len(y)) + y

def countGreater(arr, n, k):
    l = 0
    r = n - 1

    # Stores the index of the left most element
    # from the array which is greater than k
    leftGreater = n

    # Finds number of elements greater than k
    while (l <= r):
        m = int(l + (r - l) / 2)
        if (arr[m] >= k):
            leftGreater = m
            r = m - 1

        # If mid element is less than
        # or equal to k update l
        else:
            l = m + 1

    # Return the count of elements
    # greater than k
    return (n - leftGreater)


# --------------------------------------------------binary------------------------------------
class BinaryTrie:
    class Node:
        def __init__(self, bit: bool = False):
            self.bit = bit  # Stores the current bit (False if 0, True if 1)
            self.children = []
            self.count = 0  # stores number of keys finishing at this bit
            self.counter = 1  # stores number of keys with this bit as prefix

    def __init__(self, size):
        self.root = BinaryTrie.Node()
        self.size = size  # Maximum size of each key

    def convert(self, key):
        """Converts key from string/integer to a list of boolean values!"""
        bits = []
        if isinstance(key, int):
            key = bin(key)[2:]
        if isinstance(key, str):
            for i in range(self.size - len(key)):
                bits += [False]
            for i in key:
                if i == "0":
                    bits += [False]
                else:
                    bits += [True]
        else:
            return list(key)
        return bits

    def add(self, key):
        """Add a key to the trie!"""
        node = self.root
        bits = self.convert(key)
        for bit in bits:
            found_in_child = False
            for child in node.children:
                if child.bit == bit:
                    child.counter += 1
                    node = child
                    found_in_child = True
                    break
            if not found_in_child:
                new_node = BinaryTrie.Node(bit)
                node.children.append(new_node)
                node = new_node
        node.count += 1

    def remove(self, key):
        """Removes a key from the trie! If there are multiple occurences, it removes only one of them."""
        node = self.root
        bits = self.convert(key)
        nodelist = [node]
        for bit in bits:
            for child in node.children:
                if child.bit == bit:
                    node = child
                    node.counter -= 1
                    nodelist.append(node)
                    break
        node.count -= 1
        if not node.children and not node.count:
            for i in range(len(nodelist) - 2, -1, -1):
                nodelist[i].children.remove(nodelist[i + 1])
                if nodelist[i].children or nodelist[i].count:
                    break

    def query(self, prefix, root=None):
        """Search for a prefix in the trie! Returns the node if found, otherwise 0."""
        if not root: root = self.root
        node = root
        if not root.children:
            return 0
        for bit in prefix:
            bit_not_found = True
            for child in node.children:
                if child.bit == bit:
                    bit_not_found = False
                    node = child
                    break
            if bit_not_found:
                return 0
        return node
#--------------------------------------------trie-------------------------------------------------
class TrieNode:

    # Trie node class
    def __init__(self):
        self.children = [None] * 26
        self.data=0
        self.isEndOfWord = False


class Trie:

    # Trie data structure class
    def __init__(self):
        self.root = self.getNode()

    def getNode(self):

        # Returns new trie node (initialized to NULLs)
        return TrieNode()

    def _charToIndex(self, ch):

        # private helper function
        # Converts key current character into index
        # use only 'a' through 'z' and lower case

        return ord(ch) - ord('a')

    def insert(self, key,val):
        pCrawl = self.root
        length = len(key)
        for level in range(length):
            index = self._charToIndex(key[level])

            # if current character is not present
            if not pCrawl.children[index]:
                pCrawl.children[index] = self.getNode()
            pCrawl = pCrawl.children[index]
            pCrawl.data+=val
        pCrawl.isEndOfWord = True

    def search(self, key):

        # Search key in the trie
        # Returns true if key presents
        # in trie, else false
        pCrawl = self.root
        length = len(key)
        c=0
        for level in range(length):
            index = self._charToIndex(key[level])
            if not pCrawl.children[index]:
                return False
            pCrawl = pCrawl.children[index]
        return pCrawl!=None
    def present(self, key):
        ans=0
        pCrawl = self.root
        length = len(key)
        c=0
        for level in range(length):
            index = self._charToIndex(key[level])
            if not pCrawl.children[index]:
                return False
            pCrawl = pCrawl.children[index]
            ans+=pCrawl.data
        if pCrawl!=None:
            return ans
        return -1
#----------------------------------trie----------------------------
n,m=map(int,input().split())
x1,y1=map(int,input().split())
x2,y2=map(int,input().split())
l=[]
for i in range(n):
    l.append(list(input()))
for i in range(n):
    for j in range(m):
        if l[i][j]=='.':
            l[i][j]=0
        else:
            l[i][j]=1
dp=[[999999999999 for i in range(m+1)]for j in range(n+1)]
dp[x1-1][y1-1]=0
def BFS(s):
    visited = [[False for i in range(m)]for j in range(n)]
    queue = []
    queue.append(s)
    visited[s[0]][s[1]] = True
    while (queue):
        s = queue.pop(0)
        for j in range(-2,3):
            for k in range(-2,3):
                if j==0 and k==0:
                    continue
                elif 0<=s[0]+j<n and 0<=s[1]+k<m and abs(j)+abs(k)==1:
                    if visited[s[0] + j][s[1] + k]==False:
                        visited[s[0] + j][s[1] + k] = True
                        queue.append((s[0] + j, s[1] + k))
                    if l[s[0]+j][s[1]+k]!=1:
                        dp[s[0] + j][s[1] + k] = min(dp[s[0]][s[1]], dp[s[0] + j][s[1] + k])
                elif 0<=s[0]+j<n and 0<=s[1]+k<m:
                    if l[s[0]+j][s[1]+k]!=1:
                        dp[s[0]+j][s[1]+k]=min(dp[s[0]][s[1]]+1,dp[s[0]+j][s[1]+k])
    #print(dp)
    return dp[x2-1][y2-1]
ans=BFS((x1-1,y1-1))
if ans>=n*m:
    print(-1)
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
def resolve():
  H, W = map(int, input().split(" "))
  Ch, Cw = map(int, input().split(" "))
  wiz_pos = [Ch-1, Cw-1]
  Dh, Dw = map(int, input().split(" "))
  goal_pos = [Dh-1, Dw-1]

  cell_or_wall = []
  count = 0
  for _ in range(H):
    cell_or_wall.append([x == "." for x in list(input())])

  cost_of_cells = [[None] * W for i in range(H)]
  next_cells = set([tuple(wiz_pos)])
  cells_of_wall_side = []

  cost = 0
  
  while len(next_cells) != 0:
    temp_next_cells = set()
    for target_cell in next_cells:
      cost_of_cells[target_cell[0]][target_cell[1]] = cost
      # 周辺の壁じゃないセルを確認する。
      adjacents = [
        [target_cell[0] - 1, target_cell[1]],
        [target_cell[0] + 1, target_cell[1]],
        [target_cell[0], target_cell[1] - 1],
        [target_cell[0], target_cell[1] + 1]
      ]
      for adjacent in adjacents:
        h = adjacent[0]
        w = adjacent[1]
        if h < 0 or h >= H:
          continue
        if w < 0 or w >= W:
          continue

        # print("[h, w] : {}".format([h, w]), "cell_or_wall[h][w] : {}".format(cell_or_wall[h][w]))
        if not cell_or_wall[h][w]:
          # 壁際だった場合は壁際セルリストに追加する。
          if len(cells_of_wall_side) == 0:
            cells_of_wall_side.append(target_cell)
          elif cells_of_wall_side[-1][0] != target_cell[0] and cells_of_wall_side[-1][1] != target_cell[1]:
            cells_of_wall_side.append(target_cell)
        elif cost_of_cells[h][w] is None:
          temp_next_cells.add((h, w))
    # print(target_cell)
    # print(temp_next_cells)
    next_cells = temp_next_cells

    if len(next_cells) != 0:
      continue

    # 壁際のセルを確認して、ワープで飛べないか確認する。
    # print(cells_of_wall_side)
    for target_cell in cells_of_wall_side:
      # 飛べるなら next_cells に追加する
      for h in range(target_cell[0] - 2, target_cell[0] + 3):
        if h < 0 or h >= H:
          continue
        for w in range(target_cell[1] - 2, target_cell[1] + 3):
          if w < 0 or w >= W:
            continue
          if cell_or_wall[h][w] and cost_of_cells[h][w] is None:
            next_cells.add((h, w))
    cells_of_wall_side = []
    cost += 1
  
  # for cost_line in cost_of_cells:
  #   print("")
  #   for cell in cost_line:
  #     if cell is None:
  #       print("*", end="")
  #     else:
  #       print(cell, end="")

  # print("")

  if cost_of_cells[goal_pos[0]][goal_pos[1]] is None:
    print(-1)
  else:
    print(cost_of_cells[goal_pos[0]][goal_pos[1]])

if __name__ == "__main__":
  resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
  H, W = map(int, input().split(" "))
  Ch, Cw = map(int, input().split(" "))
  wiz_pos = [Ch-1, Cw-1]
  Dh, Dw = map(int, input().split(" "))
  goal_pos = [Dh-1, Dw-1]

  cell_or_wall = []
  count = 0
  for _ in range(H):
    cell_or_wall.append([x == "." for x in list(input())])

  cost_of_cells = [[None] * W for i in range(H)]
  next_cells = set([tuple(wiz_pos)])
  cells_of_wall_side = []

  cost = 0
  
  while len(next_cells) != 0:
    temp_next_cells = set()
    for target_cell in next_cells:
      cost_of_cells[target_cell[0]][target_cell[1]] = cost
      # 周辺の壁じゃないセルを確認する。
      adjacents = [
        [target_cell[0] - 1, target_cell[1]],
        [target_cell[0] + 1, target_cell[1]],
        [target_cell[0], target_cell[1] - 1],
        [target_cell[0], target_cell[1] + 1]
      ]
      for adjacent in adjacents:
        h = adjacent[0]
        w = adjacent[1]
        if h < 0 or h >= H:
          continue
        if w < 0 or w >= W:
          continue

        # print("[h, w] : {}".format([h, w]), "cell_or_wall[h][w] : {}".format(cell_or_wall[h][w]))
        if not cell_or_wall[h][w]:
          # 壁際だった場合は壁際セルリストに追加する。
          if len(cells_of_wall_side) == 0:
            cells_of_wall_side.append(target_cell)
          elif cells_of_wall_side[-1][0] != target_cell[0] and cells_of_wall_side[-1][1] != target_cell[1]:
            cells_of_wall_side.append(target_cell)
        elif cost_of_cells[h][w] is None:
          temp_next_cells.add((h, w))
    # print(target_cell)
    # print(temp_next_cells)
    next_cells = temp_next_cells

    if len(next_cells) != 0:
      continue

    # 壁際のセルを確認して、ワープで飛べないか確認する。
    print(cells_of_wall_side)
    for target_cell in cells_of_wall_side:
      # 飛べるなら next_cells に追加する
      for h in range(target_cell[0] - 2, target_cell[0] + 3):
        if h < 0 or h >= H:
          continue
        for w in range(target_cell[1] - 2, target_cell[1] + 3):
          if w < 0 or w >= W:
            continue
          if cell_or_wall[h][w] and cost_of_cells[h][w] is None:
            next_cells.add((h, w))
    cells_of_wall_side = []
    cost += 1
  
  # for cost_line in cost_of_cells:
  #   print("")
  #   for cell in cost_line:
  #     if cell is None:
  #       print("*", end="")
  #     else:
  #       print(cell, end="")

  # print("")

  if cost_of_cells[goal_pos[0]][goal_pos[1]] is None:
    print(-1)
  else:
    print(cost_of_cells[goal_pos[0]][goal_pos[1]])

if __name__ == "__main__":
  resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
  H, W = map(int, input().split(" "))
  Ch, Cw = map(int, input().split(" "))
  wiz_pos = [Ch-1, Cw-1]
  Dh, Dw = map(int, input().split(" "))
  goal_pos = [Dh-1, Dw-1]

  cell_or_wall = []
  count = 0
  for _ in range(H):
    cell_or_wall.append([x == "." for x in list(input())])

  cost_of_cells = [[None] * W for i in range(H)]
  next_cells = set([tuple(wiz_pos)])
  cells_of_wall_side = []

  cost = 0
  
  while len(next_cells) != 0:
    temp_next_cells = set()
    for target_cell in next_cells:
      cost_of_cells[target_cell[0]][target_cell[1]] = cost
      # 周辺の壁じゃないセルを確認する。
      adjacents = [
        [target_cell[0] - 1, target_cell[1]],
        [target_cell[0] + 1, target_cell[1]],
        [target_cell[0], target_cell[1] - 1],
        [target_cell[0], target_cell[1] + 1]
      ]
      for adjacent in adjacents:
        h = adjacent[0]
        w = adjacent[1]
        if h < 0 or h >= H:
          continue
        if w < 0 or w >= W:
          continue

        # print("[h, w] : {}".format([h, w]), "cell_or_wall[h][w] : {}".format(cell_or_wall[h][w]))
        if not cell_or_wall[h][w]:
          # 壁際だった場合は壁際セルリストに追加する。
          if len(cells_of_wall_side) == 0:
            cells_of_wall_side.append(target_cell)
          elif cells_of_wall_side[-1][0] != target_cell[0] and cells_of_wall_side[-1][1] != target_cell[1]:
            cells_of_wall_side.append(target_cell)
        elif cost_of_cells[h][w] is None:
          temp_next_cells.add((h, w))
    # print(target_cell)
    # print(temp_next_cells)
    next_cells = temp_next_cells

    if len(next_cells) != 0:
      continue

    # 壁際のセルを確認して、ワープで飛べないか確認する。
    print(cells_of_wall_side)
    for target_cell in cells_of_wall_side:
      # 飛べるなら next_cells に追加する
      for h in range(target_cell[0] - 2, target_cell[0] + 3):
        if h < 0 or h >= H:
          continue
        for w in range(target_cell[1] - 2, target_cell[1] + 3):
          if w < 0 or w >= W:
            continue
          if cell_or_wall[h][w] and cost_of_cells[h][w] is None:
            next_cells.add((h, w))
    cells_of_wall_side = []
    cost += 1
  
  for cost_line in cost_of_cells:
    print("")
    for cell in cost_line:
      if cell is None:
        print("*", end="")
      else:
        print(cell, end="")

  print("")

  if cost_of_cells[goal_pos[0]][goal_pos[1]] is None:
    print(-1)
  else:
    print(cost_of_cells[goal_pos[0]][goal_pos[1]])

if __name__ == "__main__":
  resolve()

Submission status: Wrong Answer

Solution code:
h,w=map(int, input().split())
c_h,c_w=map(int, input().split())
d_h,d_w=map(int, input().split())
map=[[-1]*w for i in range(h)]
 
for gyou in range(h):
    tmp=input()
    for retu in range(w):
        if tmp[retu]=="#":map[gyou][retu]=-2
 
genzai=[[c_h-1,c_w-1]]
wapu=[[c_h-1,c_w-1]]
 
map[c_h-1][c_w-1]=0
 
def idou(gyou,retu,kaisuu):
    for i in (-1,1):
        if 0<=gyou+i and gyou+i<h:
            if map[gyou+i][retu]==-1:
                map[gyou+i][retu]=kaisuu
                genzai.append([gyou+i,retu])
                wapu.append([gyou+i,retu])
    for i in (-1,1):
        if 0<=retu+i and retu+i<w:
            if map[gyou][retu+i]==-1:
                map[gyou][retu+i]=kaisuu
                genzai.append([gyou,retu+i])
                wapu.append([gyou,retu+i])


def idou_wapu(gyou,retu,kaisuu):
    for i in range(-2,3):
        for j in range(-2,3):
            if 0<=gyou+i and gyou+i<h and 0<=retu+j and retu+j<w:
                if map[gyou+i][retu+j]==-1:
                    map[gyou+i][retu+j]=kaisuu+1
                    genzai.append([gyou+i,retu+j])

wapu_kaisuu=0

while len(genzai)!=0:
 
    while len(genzai)>0:
        idou(genzai[0][0],genzai[0][1],wapu_kaisuu)
        genzai.pop(0)
    
    while len(wapu)>0:
        idou_wapu(wapu[0][0],wapu[0][1],wapu_kaisuu)
        wapu.pop(0)
    
    wapu_kaisuu+=1

print(map[d_h-1][d_w-1])

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
x1,y1=map(int,input().split())
x2,y2=map(int,input().split())
l=[]
for i in range(n):
    l.append(list(input()))
for i in range(n):
    for j in range(m):
        if l[i][j]=='.':
            l[i][j]==0
        else:
            l[i][j]=1
dp=[[999999999999 for i in range(m+1)]for j in range(n+1)]
dp[x1-1][y1-1]=0
def BFS(s):
    visited = [[False for i in range(m)]for j in range(n)]
    queue = []
    queue.append(s)
    visited[s[0]][s[1]] = True
    c=0
    while (queue):
        c+=1
        s = queue.pop(0)
        #print(s)
        for j in range(-2,3):
            for k in range(-2,3):
                if j==0 and k==0:
                    continue
                elif 0<=s[0]+j<n and 0<=s[1]+k<m and abs(j)+abs(k)==1:
                    if visited[s[0] + j][s[1] + k]==False:
                        visited[s[0] + j][s[1] + k] = True
                        queue.append((s[0] + j, s[1] + k))
                    if l[s[0]+j][s[1]+k]!=1:
                        dp[s[0] + j][s[1] + k] = min(dp[s[0]][s[1]], dp[s[0] + j][s[1] + k])
                elif 0<=s[0]+j<n and 0<=s[1]+k<m:
                    if l[s[0]+j][s[1]+k]!=1:
                        dp[s[0]+j][s[1]+k]=min(dp[s[0]][s[1]]+1,dp[s[0]+j][s[1]+k])
    return dp[x2-1][y2-1]
ans=BFS((x1-1,y1-1))
if ans>=n*m:
    print(-1)
else:
    print(ans)