[20250213] BOJ / 골드3 / 케익 배달 / 김수연 #113
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/2159
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
케익을 순서대로 배달하는데, 각 고객의 상하좌우 인접 격자점으로 배달해야함.
최단거리로 케익을 순서대로 배달할 수 있는 거리 구하기
🔍 풀이 방법
이차원 dp 사용해서 각 고객(row)의 상하좌우 좌표(col)까지의 최소 거리를 저장함
⏳ 회고
int가 아닌 long을 사용해서 저장해야 한다.. (숫자보고 조금 크다 싶으면 그냥 long 써야겠다)