Ruudukko

import time
import sys

sys.setrecursionlimit(100000)

n = int(input())
ruudukko = []
points = {}

for i in range(n):
    row = []
    a = input()
    x = a.split(" ")
    for i in x:
        row.append(int(i))
    ruudukko.append(row)

def getPoints(startPoint):
    nextPoints = []
    i = startPoint[0]
    j = startPoint[1]
    i2 = 0
    j2 = 0

    # Horizontal
    while i2 < n:
        if ruudukko[i2][j] < ruudukko[i][j] and i2 != i:
            nextPoints.append((i2, j))
        i2 += 1

    # Vertical
    while j2 < n:
        if ruudukko[i][j2] < ruudukko[i][j] and j2 != j:
            nextPoints.append((i, j2))
        j2 += 1
    return nextPoints

def getPaths(currentPoint, oldPath):
    nextPoints = getPoints(currentPoint)

    for z in nextPoints:
        tempPath = oldPath[:]
        tempPath.append(z)
        earlierPoints = oldPath[:len(oldPath) - 1]

        for k in range(len(earlierPoints)):
            earlierPath = earlierPoints[1:]
            for v in tempPath:
                earlierPath.append(v)

            if earlierPoints[k] not in points.keys():
                points[earlierPoints[k]] = []
            if earlierPath not in points[earlierPoints[k]]:
                points[earlierPoints[k]].append(earlierPath)

        getPaths(z, tempPath)

        if currentPoint not in points.keys():
            points[currentPoint] = []

        if tempPath not in points[currentPoint]:
            points[currentPoint].append(tempPath)

def findStartPoint():
    startPoint = None
    largestNum = 0
    for i in range(n):
        for j in range(n):
            if ruudukko[i][j] > largestNum and (i, j) not in points.keys() and (i, j) not in c:
                largestNum = ruudukko[i][j]
                startPoint = (i, j)
    return startPoint

c = []
while True:
    startPoint = findStartPoint()
    if not startPoint:
        break
    if len(getPoints(startPoint)) == 0:
        c.append(startPoint)
        continue
    points[startPoint] = []
    getPaths(startPoint, oldPath=[startPoint])

for i, j in points.items():
    if i not in points[i]:
        points[i].append(i)

ans = 0

for i in points.values():
    ans += len(i)

print(ans)

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: 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