Ruudukko

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

def route(x,y):
    if gps[x][y]!=0:
        return gps[x][y]
    if owo[x][y]==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)
    gps[x][y] = routes
    return routes


for a in range(n):
    owo.append([int(x) for x in input().split()])
uwu = 0
#print(owo)
for a in range(n):
    for b in range(n):
        uwu += route(a,b)
print(uwu)

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

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 26, in <module>
    u...

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED