[20250227] BOJ / P5 / 한동이는 영업사원! / 신희을 #190
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
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/8012
🧭 풀이 시간
60 분
👀 체감 난이도
✏️ 문제 설명
트리가 주어지고, 방문할 노드가 순서대로 주어진다. 순서대로 방문한다 할 때 전부 방문할 수 있는 최소 길이를 구하라.
🔍 풀이 방법
현재 위치와 목적지를 LCA하면 LCA까지의 거리가 나오므로 * 2해서 누적하자.
⏳ 회고
전에 LCA 실수도 많이 했는데, 이번엔 한번에 통과해서 기분 좋다 ㅎ 실력이 성장한 것 같다.