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/6051
🧭 풀이 시간
90분
👀 체감 난이도
✏️ 문제 설명
쿼리에 따라 시간 여행을 할꺼다. 매 쿼리 후 가장 최근에 푼 문제를 출력하시오.
🔍 풀이 방법
링크드리스트를 구현해, 역추적으로 진행했다. 어려웠던 건 Node의 구조를 어떻게 구현할 것인가 였다. 근데 과거만 연관이 있기 때문에, 한방향 연결리스트로 구현했다.
⏳ 회고
처음엔 stack으로 풀려고 했는데 역추적이 불가능해서 아무것도 못했다. g선생이 Node 구조체를 알려주지 않았다면 못 풀었을지도.....