Ratsun reitit

n = int(input())

d = {}
dx = [1,2,-1,-2,1,2,-1,-2]
dy = [2,1,2,1,-2,-1,-2,-1]

for y in range(n):
    for x in range(n):
        for z in range(8):
            if x+dx[z] >= 0 and y+dy[z] >= 0 and x+dx[z] < n and y+dy[z] < n:
                if str(x)+","+str(y) in d:
                    d[str(x)+","+str(y)].append(str(x+dx[z])+","+str(y+dy[z]))
                else:
                    d[str(x)+","+str(y)] = [str(x+dx[z])+","+str(y+dy[z])]

def bfs(graph, start, goal):
    visited = []
    queue = [[start]]

    if start == goal:
        return 0

    while queue:
        path = queue.pop(0)
        node = path[-1]
        if node not in visited:
            neighbours = graph[node]
            for neighbour in neighbours:
                new_path = list(path)
                new_path.append(neighbour)
                queue.append(new_path)
                if neighbour == goal:
                    return len(new_path)-1

            visited.append(node)

for y in range(n):
    for x in range(n):
        bfs(d, "0,0", str(x)+","+str(y))

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 8

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED