Sokkelo

from itertools import product
from math import inf


def I():
    return map(int, input().split())


def main():
    n, m = I()  # y,x
    sokStr = [input() for _ in range(n)]

    def findPerson(person):
        for i in range(n):
            a = sokStr[i].find(person)
            if a != -1:
                return a, i
    Ax, Ay = findPerson("A")
    Bx, By = findPerson("B")
    Apath = []
    Bpath = []
    sokkelo = [[1 if i == "#" else 0 for i in s] for s in sokStr]
    # wall is 1, A is 2, B is 3

    def mark(x, y, side):
        if not sokkelo[y][x]:
            sokkelo[y][x] = side
            (Apath if side == 2 else Bpath).append((y, x))
            for a in (1, -1):
                if 1 <= x + a < m - 1:  # jokainen reunaruutu on seinää
                    mark(x + a, y, side)
                if 1 <= y + a < n - 1:
                    mark(x, y + a, side)

    def markA(x, y):
        if not sokkelo[y][x]:
            sokkelo[y][x] = 2
            try:
                Apath.append((y, x))
            except:
                pass
            for a in (1, -1):
                if 1 <= x + a < m - 1:  # jokainen reunaruutu on seinää
                    markA(x + a, y)
                if 1 <= y + a < n - 1:
                    markA(x, y + a)

    def markB(x, y):
        if not sokkelo[y][x]:
            sokkelo[y][x] = 3
            try:
                Bpath.append((y, x))
            except:
                pass
            for a in (1, -1):
                if 1 <= x + a < m - 1:  # jokainen reunaruutu on seinää
                    markB(x + a, y)
                if 1 <= y + a < n - 1:
                    markB(x, y + a)
    try:
        markA(Ax, Ay)  # Virhe on täällä, ei ole IndexError
    except:
        # print(0)
        # return
        pass
    if sokkelo[By][Bx] == 2:
        print(1)
        return
    try:
        markB(Bx, By)
    except:
        pass

    def isA(x, y):
        if 0 <= x < m and 0 <= y < n:
            return sokkelo[y][x] == 2
        return False

    mi = inf

    def ClosestA(x, y):
        d = 1
        while 1:
            for i in range(d):
                if isA(x + d - i, y + i):
                    return d
                if isA(x - d + i, y - i):
                    return d
                if isA(x + 1, y - d + i):
                    return d
                if isA(x - 1, y + d - i):
                    return d
            if d > mi:
                return mi
        pass
    for x, y in product(range(m), range(n)):
        if sokkelo[y][x] == 3:
            e = ClosestA(x, y)
            if e < mi:
                mi = e
    print(mi)
    return

    def manhattan(a, b):
        return abs(a[0] - b[0]) + abs(a[1] - b[1])
    print(min(manhattan(a, b) for a, b in product(Apath, Bpath)))


if __name__ == "__main__":
    main()

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED