[20251014] BOJ / G4 / 수도배관공사 / 김수연 #1118
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/2073
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
거리 D만큼 떨어진 곳에서 물을 끌어오려고 할 때, P개의 파이프를 연결해서 정확히 D와 같게 하려고 함
이 때, 가능한 최대 수도관 용량 구하기
🔍 풀이 방법
dp사용
파이프 i개만큼 사용했을 때, j길이만큼 되는 2차원 dp 사용할까 했는데
길이만 고려하는 1차원 dp로 해결 가능했음
⏳ 회고
dp치고 낫뱃