Ruudukko

GridSize = int(input())
Grid = []
paths = 0
counter = 0
for p in range(0, GridSize, 1):
    GridRow = input().split()
    for x in range(0, len(GridRow)):
        Grid.append([counter,int(GridRow[x]),1])
        counter += 1

sortedList = sorted(Grid,key=lambda Grid:Grid[1])
#print(sortedList)
counter = 0
def CheckDirections(position, Grid):
    global paths
    global GridSize
    position = position
    y = (position//GridSize)
    x = position-y*GridSize
    pathsInMe = Grid[position][2]
    #print(x,y)
    #Check up
    for offset in range(1, y+1):
            if(Grid[position-GridSize*offset][1] > Grid[position][1]):
                    Grid[position-GridSize*offset][2] += pathsInMe
    #Check down
    for offset in range(1, GridSize - y):
            if(Grid[position+GridSize*offset][1] > Grid[position][1]):
                Grid[position+GridSize*offset][2] += pathsInMe
    for offset in range(1, x+1):
        #Check left
            if(Grid[position-offset][1]> Grid[position][1]):
                Grid[position-offset][2] += pathsInMe

    for offset in range(1, GridSize - x):
        #Check right
            if(Grid[position+offset][1]> Grid[position][1]):
                Grid[position+offset][2] += pathsInMe
    paths += Grid[position][2]
    
for i in sortedList:
        CheckDirections(i[0], Grid)

result = (paths)%(10**9+7)
print(result)

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