[백준/파이썬] 5566번 Штурм

-Code

dy = [0, -1, 0, 1]
dx = [-1, 0, 1, 0]
n, m = map(int, input().split())
cell = [list(map(int, input().split())) for _ in range(n)]
answer= 0

for i in range(0, n):
    for j in range(0, m):
        flag = True
        for k in range(0, 4):
            y = i + dy[k]
            x = j + dx[k]
            if 0 <= y < n and 0 <= x < m:
                if cell[y][x] >= cell[i][j]:
                    flag = False
                    break
        if flag:
            answer += 1

print(answer)