CSES - Aalto Competitive Programming 2024 - wk2 - Mon

CSES - Aalto Competitive Programming 2024 - wk2 - Mon - Results

Submission details
Task:	Abandoned warehouse
Sender:	Meriem
Submission time:	2024-09-09 17:40:34 +0300
Language:	PyPy3
Status:	READY
Result:	RUNTIME ERROR

Test results
test	verdict	time
#1	ACCEPTED	0.05 s	details
#2	ACCEPTED	0.05 s	details
#3	ACCEPTED	0.05 s	details
#4	ACCEPTED	0.05 s	details
#5	ACCEPTED	0.05 s	details
#6	ACCEPTED	0.13 s	details
#7	RUNTIME ERROR	0.32 s	details
#8	RUNTIME ERROR	0.27 s	details
#9	RUNTIME ERROR	0.62 s	details
#10	RUNTIME ERROR	0.67 s	details
#11	RUNTIME ERROR	0.10 s	details
#12	RUNTIME ERROR	0.08 s	details
#13	RUNTIME ERROR	0.57 s	details
#14	ACCEPTED	0.05 s	details
#15	ACCEPTED	0.05 s	details
#16	RUNTIME ERROR	0.76 s	details

Code

from collections import deque
import sys

sys.setrecursionlimit(50)


def bfs(x, y, output):
    moves[x][y] = "X"
    possible_moves = [(1, 0, "D"), (0, -1, "L"), (-1, 0, "U"), (0, 1, "R")]
    end = False
    q = deque([(x, y)])
    while q:
        x, y = q.popleft()
        if graph[x][y] == "B":
            end = True
            break
        visited[x][y] = True
        for dx, dy, move in possible_moves:
            new_x, new_y = x + dx, y + dy
            if (
                0 <= new_x < n
                and 0 <= new_y < m
                and graph[new_x][new_y] != "#"
                and not visited[new_x][new_y]
            ):
                visited[new_x][new_y] = True
                moves[new_x][new_y] = move
                q.append((new_x, new_y))

    if end:
        back_path(x, y, output)
        return True
    else:
        return False


def task3(n, m, graph):
    output = []
    for i in range(n):
        for j in range(m):
            if graph[i][j] == "A":
                start = (i, j)
            elif graph[i][j] == "B":
                dest = (i, j)

    if bfs(start[0], start[1], output):
        print("YES")
        print(len(output))
        output = reversed(output)
        print("".join(output))
    else:
        print("NO")


def back_path(x, y, output):
    if moves[x][y] != "X":
        move = moves[x][y]
        output.append(move)
        if move == "U":
            back_path(x + 1, y, output)
        elif move == "D":
            back_path(x - 1, y, output)
        elif move == "L":
            back_path(x, y + 1, output)
        elif move == "R":
            back_path(x, y - 1, output)


if __name__ == "__main__":
    n, m = map(int, input().split())
    graph = [input().strip() for i in range(n)]
    visited = [[False] * m for i in range(n)]
    moves = []
    moves = [[""] * m for i in range(n)]
    task3(n, m, graph)

Test details

Test 1

Verdict: ACCEPTED

input
`10 10 ##.A###### #.##.##.## #####..### .######### ...` view save

correct output
`NO` view save

user output
`NO` view save

Test 2

Verdict: ACCEPTED

input
`10 10 B#..##.#.. #....A##.. #.....#..# .#......#. ...` view save

correct output
`NO` view save

user output
`NO` view save

Test 3

Verdict: ACCEPTED

input
`10 10 ...#..A.#. ....B...## ...#...... .......... ...` view save

correct output
`YES 3 LLD` view save

user output
`YES 3 DLL` view save

Test 4

Verdict: ACCEPTED

input
`10 10 .#........ .......... .......... ........#. ...` view save

correct output
`YES 1 R` view save

user output
`YES 1 R` view save

Test 5

Verdict: ACCEPTED

input
`10 10 .......... .......... .......... .......... ...` view save

correct output
`YES 3 RDD` view save

user output
`YES 3 DDR` view save

Test 6

Verdict: ACCEPTED

input
`1000 1000 ##.###..######.#########.###.#...` view save

correct output
`NO` view save

user output
`NO` view save

Test 7

Verdict: RUNTIME ERROR

input
`1000 1000 ####.#.###....#.......##.##.#....` view save

correct output
`YES 626 LLLDDRDDDDLDLDDLLLLLDDDDLLDLDL...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 75, in <module>
    task3(n, m, graph)
  File "input/code.py", line 46, in task3
    if bfs(start[0], start[1], output):
  File "input/code.py", line 31, in bfs
    back_path(x, y, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path...

Test 8

Verdict: RUNTIME ERROR

input
`1000 1000 ....#.##......#....#......#......` view save

correct output
`YES 364 LULULLULLLULLLLLUULLLLUUULLLLL...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 75, in <module>
    task3(n, m, graph)
  File "input/code.py", line 46, in task3
    if bfs(start[0], start[1], output):
  File "input/code.py", line 31, in bfs
    back_path(x, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  [Previous line repeated 2 more times]
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  Fil...

Test 9

Verdict: RUNTIME ERROR

input
`1000 1000 .................#......#........` view save

correct output
`YES 1003 LLLLLLLLLLLLLLLLLLLLLLLLLDLLLL...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 75, in <module>
    task3(n, m, graph)
  File "input/code.py", line 46, in task3
    if bfs(start[0], start[1], output):
  File "input/code.py", line 31, in bfs
    back_path(x, y, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 62, in back_path
    back_path(x - 1, y, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  [Previous line repeated 3 more times]
  Fil...

Test 10

Verdict: RUNTIME ERROR

input
`1000 1000 .................................` view save

correct output
`YES 947 LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 75, in <module>
    task3(n, m, graph)
  File "input/code.py", line 46, in task3
    if bfs(start[0], start[1], output):
  File "input/code.py", line 31, in bfs
    back_path(x, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  [Previous line repeated 67 more times]
  File "input/code.py", line 56, in back_path
    if moves[x][y] != "X":
RecursionError: maximum recursion depth exceeded

Test 11

Verdict: RUNTIME ERROR

input
`1000 3 A#B .#. .#. .#. ...` view save

correct output
`YES 2000 DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 75, in <module>
    task3(n, m, graph)
  File "input/code.py", line 46, in task3
    if bfs(start[0], start[1], output):
  File "input/code.py", line 31, in bfs
    back_path(x, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  [Previous line repeated 67 more times]
  File "input/code.py", line 56, in back_path
    if moves[x][y] != "X":
RecursionError: maximum recursion depth exceeded

Test 12

Verdict: RUNTIME ERROR

input
`3 1000 A................................` view save

correct output
`YES 2000 RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 75, in <module>
    task3(n, m, graph)
  File "input/code.py", line 46, in task3
    if bfs(start[0], start[1], output):
  File "input/code.py", line 31, in bfs
    back_path(x, y, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  File "input/code.py", line 64, in back_path
    back_path(x, y + 1, output)
  [Previous line repeated 67 more times]
  File "input/code.py", line 56, in back_path
    if moves[x][y] != "X":
RecursionError: maximum recursion depth exceeded

Test 13

Verdict: RUNTIME ERROR

input
`999 999 A#...#...#...#...#...#...#...#...` view save

correct output
`YES 499998 DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 75, in <module>
    task3(n, m, graph)
  File "input/code.py", line 46, in task3
    if bfs(start[0], start[1], output):
  File "input/code.py", line 31, in bfs
    back_path(x, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  File "input/code.py", line 60, in back_path
    back_path(x + 1, y, output)
  [Previous line repeated 67 more times]
  File "input/code.py", line 56, in back_path
    if moves[x][y] != "X":
RecursionError: maximum recursion depth exceeded

Test 14

Verdict: ACCEPTED

input
`1 3 A.B` view save

correct output
`YES 2 RR` view save

user output
`YES 2 RR` view save

Test 15

Verdict: ACCEPTED

input
`2 2 ## AB` view save

correct output
`YES 1 R` view save

user output
`YES 1 R` view save

Test 16

Verdict: RUNTIME ERROR

input
`1000 1000 A................................` view save

correct output
`YES 1998 RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 75, in <module>
    task3(n, m, graph)
  File "input/code.py", line 46, in task3
    if bfs(start[0], start[1], output):
  File "input/code.py", line 31, in bfs
    back_path(x, y, output)
  File "input/code.py", line 66, in back_path
    back_path(x, y - 1, output)
  File "input/code.py", line 66, in back_path
    back_path(x, y - 1, output)
  File "input/code.py", line 66, in back_path
    back_path(x, y - 1, output)
  [Previous line repeated 67 more times]
  File "input/code.py", line 56, in back_path
    if moves[x][y] != "X":
RecursionError: maximum recursion depth exceeded

Aalto Competitive Programming 2024 - wk2 - Mon

Abandoned warehouse

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Tasks

Submissions (Meriem)