[백준 문제풀이] 얼렁뚱땅 3184 양 풀이

https://www.acmicpc.net/problem/3184

3184번: 양

 

이~~~~~~~~지~~~~~~~~ 19분만에 풀어서 기분 좋은뎁쇼

 

from collections import deque

n, m = map(int,input().split())
arr = [list(map(str,input())) for _ in range(n)]
visited = [[False]*m for _ in range(n)]

dx = [0, 0, 1, -1]
dy = [1, -1, 0, 0]

def bfs(x_,y_) :
    global sheep
    global wolf

    q = deque()
    q.append([x_,y_])
    visited[x_][y_] = True

    while q :
        x, y = q.popleft()
        if arr[x][y] == 'v' :
            wolf += 1
        elif arr[x][y] == 'o' :
            sheep += 1
        
        for k in range(4) :
            nx = x + dx[k]
            ny = y + dy[k]
            if 0<=nx<n and 0<=ny<m :
                if arr[nx][ny] != '#' and visited[nx][ny] == False :
                    q.append([nx,ny])
                    visited[nx][ny] = True
all_wolf = 0
all_sheep = 0
for i in range(n) :
    for j in range(m) :
        if visited[i][j] == False :
            sheep = 0
            wolf  = 0
            bfs(i,j)
            if sheep > wolf :
                all_sheep += sheep
            else :
                all_wolf += wolf

print(all_sheep, all_wolf)