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
1 participant
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/3584
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
트리의 부모자식 정보들이 주어졌을 때
2개의 노드의 조상 중 가장 가까운 공통 조상을 구하는 문제입니다(노드에서 가장 가까운, 루트에서 가장 먼)
🔍 풀이 방법
부모자식 정보에 따라서 트리를 구성합니다.
이후 첫번째 노드에서부터 루트로 거슬러 올라가면서 조상 정보를 기록합니다.
다음 두번째 노드에서부터 루트로 거슬러 올라가면서 첫번째 노드에서 기록한 조상 중 겹치는 부분에서 멈추고 출력합니다
⏳ 회고
단순하게 2번 탐색하는 문제였습니다.