Ruudukko

def solve(nums):
    n = len(nums)
    m = len(nums[0])
    calculated = [[-1] * m for _ in range(n)]
    indecesSorted = [(i, j) for j in range(m) for i in range(n)]
    indecesSorted.sort(key=lambda x: nums[x[0]][x[1]])
    
    def inner(idx, idx1):
        if idx < 0 or idx1 < 0:
            return 0
        elif idx >= n or idx1 >= m:
            return 0
        elif nums[idx][idx1] == 1:
            calculated[idx][idx1] = 1
            return 1
 
        else:
            total = 1
            for i in range(n):
                if nums[i][idx1] < nums[idx][idx1]:
                    up = calculated[i][idx1]
                    total += up
                    total %= 1000000007
 
            for j in range(m):
                if nums[idx][j] < nums[idx][idx1]:
                    up = calculated[idx][j]
                    total += up
                    total %= 1000000007
 
            calculated[idx][idx1] = total
            return total
 
    total = 0
    for i in range(n * m):
        curr = indecesSorted[i]
        first = curr[0]
        second = curr[1]
        total += inner(first, second) if calculated[first][second] == -1 else calculated[first][second]
        total %= 1000000007
    return total
 
n = int(input())
 
nums = [[-1] * n for _ in range(n)]
for i in range(n):
    nums[i] = [int(aValue) for aValue in input().split()]
 
print(solve(nums))

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

Test 5

Group: 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED