[20250617] BOJ / G4 / 숨바꼭질 2 / 김수연 #365
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/12851
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
수빈이는 N, 동생은 K에 있을 때,
X-1, X+1, X*2로 이동하며 동생을 찾을 수 있는 가장 빠른 시간과 방법 구하기
🔍 풀이 방법
bfs 사용해서 갈 수 있는 방법들 탐색
⏳ 회고
배열에 해당 위치까지 가는 최소 시간을 저장해두는 거를 힌트를 봤다.
알고리즘 바보 된듯..