[20251209] BOJ / G3 / 색상환 / 한종욱 #1621
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/2482
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
바로 옆에 있는 색은 선택하지 못한다. K개의 색을 고르는 경우의 수는?
🔍 풀이 방법
원형 DP이기 때문에, 첫번째를 선택하는 경우와 아닌 경우로 나눈다.
dp[i][j]: i번째 색에서 j개를 고른 경우의 수dp[i][j] = dp[i-1][j] + dp[i-2][j-1]⏳ 회고
dp는 꾸준히 풀어야 겠다. 안 풀다 푸니까 상태정의가 헷갈렸다.