Submission details
Task:Abandoned warehouse
Sender:aalto26bm_024
Submission time:2026-09-07 19:54:02 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#30.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.04 sdetails
#6ACCEPTED0.06 sdetails
#7ACCEPTED0.14 sdetails
#8ACCEPTED0.12 sdetails
#9ACCEPTED0.21 sdetails
#10ACCEPTED0.21 sdetails
#110.05 sdetails
#12ACCEPTED0.06 sdetails
#130.06 sdetails
#140.04 sdetails
#15ACCEPTED0.04 sdetails
#16ACCEPTED0.22 sdetails

Code

import sys
from collections import deque


def main():

    input = sys.stdin.readline

    n, m = map(int, input().split())
    inpt = []
    for _ in range(n):
        inpt.append(input().rstrip("\n"))

    start_node = (0, 0)
    exit_node = (0, 0)

    for i in range(1, n):
        row = inpt[i]
        j = row.find("A")
        if j >= 0:
            start_node = (i, j)
        j = row.find("B")
        if j >= 0:
            exit_node = (i, j)

    moves = [
        (1, 0),
        (-1, 0),
        (0, 1),
        (0, -1),
    ]

    q = deque([start_node])
    prev = [-1] * (n * m)

    found = False
    while q:
        i, j = q.popleft()
        if (i, j) == exit_node:
            found = True
            break
        for ii, jj in moves:
            prv = i * m + j
            if 0 <= i + ii < n and 0 <= j + jj < m and inpt[i + ii][j + jj] != "#":
                ix = (i + ii) * m + (j + jj)
                if prev[ix] == -1:
                    prev[ix] = prv
                    q.append((i + ii, j + jj))

    if found:
        print("YES")
        node = exit_node[0] * m + exit_node[1]
        sn = start_node[0] * m + start_node[1]
        trace = [node]
        while node != sn:
            node = prev[node]
            trace.append(node)
        print(len(trace) - 1)

        node = trace.pop()
        out = ""
        while len(trace) > 0:
            next = trace[-1]
            if next > node:
                if next == node + 1:
                    out += "R"
                else:
                    out += "D"
            else:
                if next == node - 1:
                    out += "L"
                else:
                    out += "U"
            node = trace.pop()
        print(out)
    else:
        print("NO")


main()

Test details

Test 1

Verdict: ACCEPTED

input
10 10
##.A######
#.##.##.##
#####..###
.#########
...

correct output
NO

user output
NO

Test 2

Verdict: ACCEPTED

input
10 10
B#..##.#..
#....A##..
#.....#..#
.#......#.
...

correct output
NO

user output
NO

Test 3

Verdict:

input
10 10
...#..A.#.
....B...##
...#......
..........
...

correct output
YES
3
LLD

user output
YES
5
DRRRR

Test 4

Verdict: ACCEPTED

input
10 10
.#........
..........
..........
........#.
...

correct output
YES
1
R

user output
YES
1
R

Test 5

Verdict: ACCEPTED

input
10 10
..........
..........
..........
..........
...

correct output
YES
3
RDD

user output
YES
3
DDR

Test 6

Verdict: ACCEPTED

input
1000 1000
##.###..######.#########.###.#...

correct output
NO

user output
NO

Test 7

Verdict: ACCEPTED

input
1000 1000
####.#.###....#.......##.##.#....

correct output
YES
626
LLLDDRDDDDLDLDDLLLLLDDDDLLDLDL...

user output
YES
626
RDDDDDLDDDDLDDDDLLLLLLDDLLLDDL...

Test 8

Verdict: ACCEPTED

input
1000 1000
....#.##......#....#......#......

correct output
YES
364
LULULLULLLULLLLLUULLLLUUULLLLL...

user output
YES
364
UUUUUULUUUUUUUUUUULLLUUUULLUUU...

Test 9

Verdict: ACCEPTED

input
1000 1000
.................#......#........

correct output
YES
1003
LLLLLLLLLLLLLLLLLLLLLLLLLDLLLL...

user output
YES
1003
DDDDDDDDDDDDDDDDDLDDDDDDDDDDDD...

Test 10

Verdict: ACCEPTED

input
1000 1000
.................................

correct output
YES
947
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

user output
YES
947
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

Test 11

Verdict:

input
1000 3
A#B
.#.
.#.
.#.
...

correct output
YES
2000
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
YES
0

Test 12

Verdict: ACCEPTED

input
3 1000
A................................

correct output
YES
2000
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
YES
2000
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 13

Verdict:

input
999 999
A#...#...#...#...#...#...#...#...

correct output
YES
499998
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
YES
0

Test 14

Verdict:

input
1 3
A.B

correct output
YES
2
RR

user output
YES
0

Test 15

Verdict: ACCEPTED

input
2 2
##
AB

correct output
YES
1
R

user output
YES
1
R

Test 16

Verdict: ACCEPTED

input
1000 1000
A................................

correct output
YES
1998
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
YES
1998
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...