def solution(land): n, m = len(land), len(land[0]) answer = [0 for _ in range(m)] delta = [(0,1), (0,-1), (1,0), (-1,0)] dp = [[True if land[i][j] else False for j in range(m)] for i in range(n)] idx = 0 for y in range(n): for x in range(m): if type(dp[y][x]) == bool and dp[y][x]: idx += 1 visited = [(y,x)] ..