[파이썬] 16724 피리 부는 사나이

n, m = map(int, input().split())
board = [list(input()) for _ in range(n)]
visited = [[0] * m for _ in range(n)]
d = {
    'L': [0, -1],
    'R': [0, 1],
    'U': [-1, 0],
    'D': [1, 0]
}
count, ans = 0, 0

def dfs(x, y, c):
    global ans
    if visited[x][y]:
        if visited[x][y] == c:
            ans += 1
        return

    visited[x][y] = c
    nx, ny = x + d[board[x][y]][0], y + d[board[x][y]][1]
    dfs(nx, ny, c)

for i in range(n):
    for j in range(m):
        if not visited[i][j]:
            count += 1
            dfs(i, j, count)

print(ans)

dfs