Ruudukko

owo = []
gps = [[0]*1000 for i in range(1000)]
n = int(input())
visited = 0
xd = n*n

def route(x,y):
    global visited, uwu
    if gps[x][y]!=0:
        return gps[x][y]
    if owo[x][y]==1:
        gps[x][y] = 1
        visited+=1
        uwu+=1
        return 1
    routes = 1
    for i in range(n):
        if owo[i][y]<owo[x][y]:
            routes+=route(i,y)
        if owo[x][i]<owo[x][y]:
            routes+=route(x,i)
        if routes>1_000_000_007:
            routes = pow(routes,1,1000000007)
    gps[x][y] = routes
    visited+=1
    uwu += routes
    return routes
 
 
for a in range(n):
    owo.append([int(x) for x in input().split()])
uwu = 0
for a in range(n):
    for b in range(n):
        route(a,b)
        if visited == xd:
            break
    else:
        continue
    break
print(pow(uwu,1,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: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED