Ruudukko

paths = 0
grid = []

n = int(input())

for i in range(n):
    grid.append(list(map(int, input().split(" "))))


def findPaths(y, x):
    global paths

    smaller_positions = []
    current_value = grid[y][x]

    for i in range(n):
        if (grid[y][i] < current_value):
            smaller_positions.append([y, i])

    for i in range(n):
        if (grid[i][x] < current_value):
            smaller_positions.append([i, x])

    paths += len(smaller_positions)

    for position in smaller_positions:
        findPaths(position[0], position[1])


for i in range(n):
    for l in range(n):
        findPaths(i, l)

print(paths)

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

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