Ruudukko

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

def TriangleNumber(n):
    return int((n*(n+1))/2)

def CheckDirections(x,y,NextMovement, multiplier):
    global Grid
    global paths
    global GridSize
    position = y*GridSize+x

    #Check up
    for offset in range(1, y+1):
            if(Grid[position-GridSize*offset] < Grid[position]):
                NextMovement.append([x,y-offset])
                paths +=multiplier    
    #Check down
    for offset in range(1, GridSize - y):
            if(Grid[position+GridSize*offset] < Grid[position]):
                NextMovement.append([x,y+offset])
                paths += multiplier
    for offset in range(1, x+1):
        #Check left
            if(Grid[position-offset]< Grid[position]):
                NextMovement.append([x-offset,y])
                paths += multiplier
    for offset in range(1, GridSize - x):
        #Check right
            if(Grid[position+offset]< Grid[position]):
                NextMovement.append([x+offset,y])
                paths += multiplier
    

    #--------------------Checking for second route--------------
    #if y-1 > 0:
    #    if(Grid[position-GridSize*2] < Grid[position]):
    #        NextMovement.append([x,y-2])
    #        paths += multiplier
    ##Check down
    #if y+1 < GridSize-1:
    #    if(Grid[position+GridSize*2] < Grid[position]):
    #        NextMovement.append([x,y+2])
    #        paths += multiplier
    ##Check left
    #if x-1 > 0:
    #    if(Grid[position-2]< Grid[position]):
    #        NextMovement.append([x-2,y])
    #        paths += multiplier
    ##Check right
    #if x+1 < GridSize-1:
    #    if(Grid[position+2]< Grid[position]):
    #        NextMovement.append([x+2,y])
    #        paths += multiplier

for y in range(0, GridSize):
    for x in range(0, GridSize):
        CheckDirections(x,y, NextMovement, 1)
            
multiplier = 1
firstRun = False
while(len(NextMovement) > 0):
    MovementArray=[]
    for i in range(0, len(NextMovement)):
        CheckDirections(NextMovement[i][0],NextMovement[i][1], MovementArray, multiplier)
    NextMovement = MovementArray
    firstRun = True

result = (paths+GridSize**2)%(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: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED