[20250206] BOJ / 골드5 / 별자리 찾기 / 설진영 #48
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
ShinHeeEul
changed the title
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/5588
🧭 풀이 시간
70분 (진짜 비슷한문제나오면 20분 컷 가능)
👀 체감 난이도
✏️ 문제 설명
원하는 별자리, 전체 별 좌표 주고 별자리까지 이동 얼마나 해야하는지 출력
🔍 풀이 방법
당연히 집합 써서 구해야 하고, 모든 좌표 검색하는게 아니라, 별자리 좌표 하나 선정해서 전체 각 별에 하나씩 같다붙혀야 한다. 아니면 메모리 초과나거나 시간초과나거나..
⏳ 회고
처음에 이상하게 풀려다 시간 다날렸다... 쉬운 문제는 쉽게 풀자(?)