백준 3184 양 python

https://www.acmicpc.net/submit/3184/49276284

우리 안의 양과 늑대를 세는 문제
우리가 어떻게 나뉘는 가를 생각한 후 DFS/BFS를 쓰면 해결된다.

import sys
sys.setrecursionlimit(100000)

def DFS(x, y):
    global wolf, sheep
    visited[x][y] = True
    if farm[x][y] == 'v':
        wolf += 1
    elif farm[x][y] == 'o':
        sheep += 1
    for dx, dy in d:
        nx, ny = x + dx, y + dy
        if nx < 0 or ny < 0 or nx >= R or ny >= C: continue
        if farm[nx][ny] == '#' or visited[nx][ny]: continue
        DFS(nx, ny)


R, C = map(int, input().split()) # 행 열
farm = [list(input()) for _ in range(R)]
visited = [[False] * C for _ in range(R)]
totalwolf, totalsheep = 0, 0
d = [[1, 0], [-1,0], [0, 1], [0, -1]]
for i in range(R):
    for j in range(C):
        if farm[i][j] == "#" or visited[i][j]: continue
        wolf, sheep = 0, 0
        DFS(i, j)
        if wolf >= sheep: totalwolf += wolf
        else: totalsheep += sheep

print(totalsheep, totalwolf)