[20260128] BOJ / G3 / Traveling SCCC President / 한종욱 #1848
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/28119
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
숭실대 각 1~N번까지의 건물에서 회의를 차례대로 진행해야 한다. S번 건물에서 출발해서 N개의 회의를 차례대로 마친 다음에 다시 S번 건물로 돌아오는 데 필요한 최소 시간을 출력하라.
🔍 풀이 방법
S번 건물로 돌아오지만 한번 방문한 건물로 순간이동할 수 있기 때문에, 결국엔 MST의 비용을 물어보는 문제이다. kruskal로 풀었다.
⏳ 회고
문제가 길어서 어려워 보여 선택했는데, 기본을 물어보는 문제였다.