Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1520
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
높이가 쓰여있는 N*M 크기의 맵이 주어졌을 때
0,0 에서 N-1,M-1 까지 내리막길로만 내려갈 수 있는 경우의 수의 갯수를 구하는 문제입니다.
🔍 풀이 방법
처음에는 그냥 0,0에서 목적지까지 dfs로 돌리면서 순회하려고 했는데 시간초과가 났습니다.
그래서 dp를 더하여 dp[y][x] = dp[y][x]에서 목적지까지 가는 경우의 수 갯수 로 하여 풀었습니다.
⏳ 회고
문제 사이즈와 케이스를 잘 확인합시다