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
2 participants
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/13913
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
좌표평면 위에 수빈이와 동생이 있고 수빈이가 매초 (+1칸, -1칸, *2로 순간이동) 할 때 동생을 찾는 최소 시간과 루트를 구하는 문제입니다.
🔍 풀이 방법
기본적으로 풀었던 숨바꼭질에 prev 배열을 두어서 과정을 역추적 하는 로직을 구현했습니다.
⏳ 회고
역추적 하는 방법에 대해서 고민했었는데 배열과 스택에 다시 담고 그 스택을 다시 출력하는 형식으로 구현했습니다. 뭔가 더 똑똑한 방법이 있을 것 같은데 찾아봐야 될 것 같습니다.