from collections import deque def count_safe_land(x, y, grid): visited = [[False] * y for _ in range(x)] directions = [(-1,0), (1,0), (0,-1), (0,1)] def bfs(i, j): queue = deque() queue.append((i, j)) visited[i][j] = True while queue: ci, cj = queue.popleft() for di, dj in directions: ni, nj = ci + ...