[20260204] BOJ / G1 / 냅색문제 / 김민진 #1884
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.
🧷 문제 링크
냅색문제
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
N개의 물건이 있고C만큼 담을 수 있는 가방이 있을 때 가방에 넣을 수 있는 물건 조합의 경우의 수는?🔍 풀이 방법
중간에서 만나기 + 이분탐색
⏳ 회고
부분수열의 합 2 문제랑 비슷해서 맵으로 풀었는데 메모리초과 남
중간에서 만나기는 리스트 써서 이분탐색하는게 일반적이라고 함