[20260306] BOJ / G3 / LCA / 한종욱#1997
Merged
ShinHeeEul merged 1 commit intomainfrom Mar 6, 2026
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/11437
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
트리가 주어지고, 두 노드를 주었을 때, 제일 먼저 만나는 공통 부모는?
🔍 풀이 방법
BFS로 각 노드의 depth와 parent를 구한 다음, level이 같을 때까지 하나를 올린다. 그리고 같은 level에서 부모가 다를 때마다 한 칸씩 위로 올려서 찾았다.
⏳ 회고
그래프는 재밌다.