Abandoned warehouse

import sys

sys.setrecursionlimit(10 ** 6)

height, width = map(int, input().split())

grid = []

for h in range(height):
    row = list(input())
    grid.append(row)

A_pos = (0, 0)
B_pos = (0, 0)

for h, row in enumerate(grid):
    for w, el in enumerate(row):
        if el == "A":
            A_pos = (h, w)
        if el == "B":
            B_pos = (h, w)


best_sol = ""


def dfs(h, w, directions: str, vis: list[list[bool]]):
    global best_sol
    if h >= height or w >= width or h < 0 or w < 0 or grid[h][w] == "#" or vis[h][w]:
        return

    visit = vis.copy()
    visit[h][w] = True

    if grid[h][w] == "B":
        if (not best_sol) or len(best_sol) > len(directions):
            best_sol = directions
        return

    dfs(h - 1, w, directions + "U", visit.copy())
    dfs(h, w + 1, directions + "R", visit.copy())
    dfs(h + 1, w, directions + "D", visit.copy())
    dfs(h, w - 1, directions + "L", visit.copy())


visited = [[False for _ in range(width)] for _ in range(height)]
dfs(A_pos[0], A_pos[1], "", visited)

if best_sol:
    print("YES")
    print(len(best_sol))
    print(best_sol)
else:
    print("NO")

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: TIME LIMIT EXCEEDED