[백준][Python] 14324 Rain

visited 뒤에 [nx][ny]안붙힌거 찾느라 1시간 걸렸다.

import sys
input = sys.stdin.readline
from collections import deque


def BFS(x,y,h):
    global result
    queue = deque()
    queue.append([x,y])
    dx = [0,0,1,-1]
    dy = [1,-1,0,0]
    out_rain = False
    cnt = 1
    visited[x][y] = True
    while queue:
        x,y = queue.popleft()
        for i in range(4):
            nx = x+dx[i]
            ny = y+dy[i]
            if 0<=nx<R and 0<=ny<C:
                if not visited[nx][ny]:
                    if Rain[nx][ny]<=h:
                        queue.append([nx,ny])
                        cnt+=1
                        visited[nx][ny] = True
            else:
                out_rain = True
    if not out_rain:
        result+=cnt
    return

for test in range(int(input())):
    result = 0
    R,C = map(int,input().split())
    Rain = [list(map(int,input().split())) for _ in range(R)]
    for height in range(1,1000):
        visited = [[False]*C for _ in range(R)]
        for i in range(0,R):
            for j in range(0,C):
                if not visited[i][j] and Rain[i][j]<=height:
                    BFS(i,j,height)
    print(f'Case #{test+1}: {result}')