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/5021
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
가족 정보가 주어지고,
왕위 후보들 중에서 왕과 혈통이 가장 가까운 사람을 출력한다.
🔍 풀이 방법
왕위 후보의 혈통 정보가 HashMap에 저장되어 있지 않으면,
DFS를 이용해서 각 부모의 혈통 정보를 가져와서 HashMap에 저장한 후, answer 초기화
⏳ 회고
dfs를 사용할 때는 재귀를 탈출하는 조건을 더 상세히 설정해두어야 할 것 같다..