백준 3184 양 (파이썬)

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

3184번: 양

 

 

 

R, C = map(int, input().split())
lst = [[]*C for _ in range(R)]
visited = [[0] * C for _ in range(R)]
direction = [(1, 0), (0, 1), (-1, 0), (0, -1)]
sheep, wolf = 0, 0
for i in range(R):
    S = (list(input().rstrip()))
    lst[i] = S
 
queue = []
 
 
def bfs(x, y):
    global w, s
    visited[x][y] = 1
    queue.append([x, y])
 
    while queue:
        x, y = queue[0][0], queue[0][1]
        del queue[0]
        if lst[x][y] == 'v':
            w += 1
        elif lst[x][y] == 'o':
            s += 1
 
        for dx, dy in direction:
            nx, ny = x + dx, y + dy
            if 0 <= nx < R and 0 <= ny < C and lst[nx][ny] != '#' and visited[nx][ny] == 0:
                queue.append((nx, ny))
                visited[nx][ny] = 1
 
 
for i in range(R):
    for j in range(C):
        if lst[i][j] != '#' and visited[i][j] == 0:
            w, s = 0, 0
            bfs(i, j)
            if w >= s:
                s = 0
            else:
                w = 0
            wolf += w
            sheep += s
print(sheep, wolf)