[20250930] PGM / Lv3 / 합승 택시 요금 / 이강현 #1009
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://school.programmers.co.kr/learn/courses/30/lessons/72413
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
S에서 A와 B로 각각 갈건데 같이 택시타고감.
어디까지 같이 가야 총 비용이 최소가 되는지 구하셈
🔍 풀이 방법
다익스트라 S,A,B에서 각각 한번씩 구하고 경유지를 반복해서 넣어보면서 최소 구하기
⏳ 회고
ez