[파이썬] [DFS] 백준 3109 빵집

문제

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

3109번: 빵집

 

코드

import sys
input=sys.stdin.readline

def dfs(r,c):
    if c==col-1:
        return 1
    for i in r-1,r,r+1:
        if 0<=i<row and array[i][c+1]==".":
            array[i][c+1]="x"
            if dfs(i,c+1):
                return 1

row,col=map(int, input().split())
array=[list(input().rstrip()) for _ in range(row)]
visited=[[0]*col for _ in range(row)]

for i in range(row):
    dfs(i,0)

count=0
for i in range(row):
    if array[i][col-1]=="x":
        count+=1
print(count)