Ruudukko

paths = {}
n = int(input())
ruudukko = []
smallestNum = n * n + 1
smallest = []
notUsed = []
values = []
for i in range(n):
    row = input().split()
    ruudukko.append(row)
    for j in range(n):
        notUsed.append((i, j))
        values.append(ruudukko[i][j])
        paths[(i, j)] = 1
        num = int(row[j])
notUsed = [val for (_, val) in sorted(zip(values, notUsed), key=lambda x: x[0])]

def getPoints(startPoint):
    i = startPoint[0]
    j = startPoint[1]
    i2 = 0
    j2 = 0
    while i2 < n:
        if ruudukko[i2][j] > ruudukko[i][j] and i2 != i:
            paths[(i2, j)] += paths[startPoint]
        i2 += 1
    while j2 < n:
        if ruudukko[i][j2] > ruudukko[i][j] and j2 != j:
            paths[(i, j2)] += paths[startPoint]
        j2 += 1
 
while True:
    if len(notUsed): startPoint = notUsed.pop(0)
    else: break
    if startPoint in notUsed:
        notUsed.remove(startPoint)
    getPoints(startPoint)

print(sum(paths.values()) % 1000000007)

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: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED