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/5569
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
상근이가 (1,1) 에서 (w,h)로 출근하려고 할 때
위 또는 오른쪽으로만 갈 수 있고, 한번 방향전환하면 연속으로는 못할 때
출근할 수 있는 경우의 수를 구하는 문제입니다.
🔍 풀이 방법
DP를 이용해서 풀었습니다.
조금 특이한 경우의 케이스로 한번 방향을 바꾸면 연속으로 못하기 때문에 플래그용과
진행 방향을 나타내는 배열을 각각 추가해서 총 4차원 DP를 사용했습니다.
⏳ 회고
처음엔 그래프인줄 알았는데 DP였고, 또 4개나 체크해야되서 귀찮았습니다.