Ratsun reitit

# Author: Jussi Marttinen
# Last edited: 2020/09/28
# My solution for Datatähti 2020

from itertools import product


longparts = (-2, 2)
shortparts = (-1, 1)
legal_jumps = list(product(longparts, shortparts)) + list(product(shortparts, longparts))



def calc_tile(board, x, y):
    n = len(board)
    for x0, y0 in legal_jumps:
        if (x + x0 in range(n)) and (y + y0 in range(n)):
            tile = board[y+y0][x+x0]
        
            if (tile > board[y][x] + 1) or (tile == 0):
                board[y+y0][x+x0] = board[y][x] + 1
                board[0][0] = 0
                calc_tile(board, x + x0, y + y0)

def calc_board(board):
    n = len(board)
    done = [(0,0)]
    queue = [(0,0)]

    while queue:
        x, y = queue.pop(0)

        for x0, y0 in legal_jumps:
            X, Y = x + x0, y + y0
            if (X in range(n)) and (Y in range(n)) and ((X,Y) not in done):
                board[Y][X] = board[y][x] + 1
                done.append((X, Y))
                queue.append((X, Y))
                



n = int(input())
# creates an n*n nested list
board = [[0]*n for _ in range(n)]

calc_board(board)





print("\n".join((" ".join((str(t) for t in row)) for row in board)))

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED