Ruudukko

import sys
from random import randint
sys.setrecursionlimit(1500000000)
 
class TreeNode:
    määrä = 0
    #kutsut = 0
    def __init__(self,data, pos):
        self.data = data
        self.pos = pos
        self.children = []
        self.parent = None
 
    def add_child(self,child):
        TreeNode.määrä += 1
        self.child = child 
        child.parent = self
        self.children.append(child)
 
    def get_level(self):
        level = 0 
        p = self.parent
        while p :
            p = p.parent
            level += 1
        return level 
        
    def print_tree(self):
        print('  '*self.get_level() + '|--', end = '')
        print(self.data)
        if self.children:
            for each in self.children:
                each.print_tree()
    
def main():
    n = int(input())
    ruudukko = [[int(a) for a in input().split(' ')] for i in range(n)]
    # n = randint(1,100)
    n = 5
    if n == 1:
        print(1)
        return
    #ruudukko = [[randint(1, n**2) for i in range(n)] for a in range(n)]
    
 
    #for rivi in ruudukko:
        print(rivi)
    #input()
 
    root = TreeNode('ruudukko', None)
    eka = TreeNode(ruudukko[0][0], (0,0))
    root.add_child(eka)
    puu = rakenna_puu(ruudukko, eka, root)
    #root.print_tree()
 
 
def rakenna_puu(ruudukko, tree, root):
#print(tree.data, tree.pos)
    n = len(ruudukko)
    #TreeNode.kutsut += 1
    
    if tree == root:
        #print('yass')
        # print(tree.data, tree.pos)
        käytetyt = [t.pos for t in root.children]
        for e in range(n):
            for r in range(n):
                if (e, r) not in käytetyt:
                    nexti = TreeNode(ruudukko[e][r], (e,r))
                    tree.add_child(nexti)
                    return rakenna_puu(ruudukko, nexti, root)
        #print('done')
        #print(root.reitit)
        #root.print_tree()
        #print(TreeNode.määrä)
        print(TreeNode.määrä)
        return tree
 
 
    
    seuraavat = seur_mahdollinen(ruudukko, tree.pos)
    if seuraavat != []:
        for valinta in seuraavat:
            if valinta.pos not in [k.pos for k in tree.children]:
                tree.add_child(valinta)
                return rakenna_puu(ruudukko, valinta, root)
        # print(tree.data, [q.data for q in tree.children])
        return rakenna_puu(ruudukko, tree.parent, root)
 
 
    else:
        #root.reitit += 1
        #print('end_node ', tree.data, tree.pos)
        return rakenna_puu(ruudukko, tree.parent, root)
    #print('F??', tree)
    
 
def seur_mahdollinen(ruudukko, pos):
    n = len(ruudukko)
    mahdolliset = []
    for i in range(n):
        for j in range(n):
            if i == pos[0] or j == pos[1]:
                if ruudukko[i][j] < ruudukko[pos[0]][pos[1]]:
                    # print(ruudukko[i][j], (i, j))
                    mahdolliset.append(TreeNode(ruudukko[i][j], (i, j)))
    
    return mahdolliset
 
    
 
if __name__=='__main__':
    main()

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: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED