[20250904] BOJ / P5 / 징검다리 뒤로 건너기 / 권혁준 #818
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
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/30194
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
돌 N개가 일렬로 놓여있고, i번 돌에서는 i+x (1<=x<=K)번 돌, i-1번 돌로 갈 수 있다.
1 -> N으로 가는 경우의 수를 구해보자.
🔍 풀이 방법
dp[n][k] = n-k번 돌에서 k번 돌로 바로 가는 경우의 수로 정의하고 O(NK^2) DP를 돌렸다.⏳ 회고
복잡한 예제에서까지 답이 잘 나오는 것 같은데 진짜 왜 틀린지 모르겠음
상태 정의를 잘못 했나 싶기도 함