[20260111] BOJ / G5 / 맨해튼에서의 모임 / 한종욱 #1785
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/27297
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
N차원 좌표에서 맨해튼 거리의 합이 최소가 되는 맨해튼-포인트 포인트를 찾아라.
🔍 풀이 방법
각 차원에서 중앙값 좌표를 구해야 한다. 정렬을 하고 중앙값을 찾아서 좌표를 표현하면 된다.
⏳ 회고
N차원에서 중앙값을 어떻게 표현해야 하는지를 생각하는 게 제일 어려웠다.