[백준] 1520번 내리막 길 (파이썬)

1520번: 내리막 길

 

 

코드

import sys

m, n = map(int, sys.stdin.readline().split(" "))
check_li = [[-1 for _ in range(n)] for _ in range(m)]
li = []
for _ in range(m):
    li.append(list(map(int, sys.stdin.readline().split(" "))))


x_ext_li = [0,0,1,-1]
y_ext_li = [1,-1,0,0]

def dfs(node):
    x, y = node
    if x == m-1 and y == n-1:
        return 1
    if check_li[x][y] != -1:
        return check_li[x][y]
    check_li[x][y] = 0
    for i in range(4):
        x_ext = x + x_ext_li[i]
        y_ext = y + y_ext_li[i]
        if 0 <= x_ext < m and 0 <= y_ext < n:
            if li[x_ext][y_ext] < li[x][y]:
                check_li[x][y] += dfs([x_ext, y_ext])

    return check_li[x][y]

print(dfs([0,0]))