Ruudukko

n=int(input())
grid=[]
ans=0
for i in range(n):
  grid.append(list(map(int,input().split())))
def number_of_ways(x,y):
  total=0
  posr=x
  posc=y
  if grid[x][y] == min(grid):
    return 0
  while y != n-1 and grid[x][y]>grid[x][y+1]:
    total+=1
    y+=1
  x,y=posr,posc
  while x!=n-1 and grid[x][y]>grid[x+1][y]:
    total+=1
    x+=1
  x,y=posr,posc
  while x!=0 and grid[x][y]>grid[x-1][y]:
    total+=1
    x-=1
  x,y=posr,posc
  while y != 0 and grid[x][y]>grid[x][y-1]:
    total+=1
    y-=1
  return total
for x in range(n):
  for y in range(n):
    ans+=number_of_ways(x,y)
print(ans)

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

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