[20250930] BOJ / P3 / Alternative Mart / 권혁준 #1008
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/31588
🧭 풀이 시간
120분
👀 체감 난이도
✏️ 문제 설명
정점 N개, 간선 M개인 양방향 단순 연결 그래프가 주어지고, 정점 중 K곳은
할인마트이다.주어지는 질의 Q개를 처리해보자.
🔍 풀이 방법
할인마트에서 시작하는 multi-source 다익스트라를 돌리고 각 정점마다 서로 다른 source를 가진 최소 거리 11개를 저장해둔다.
출발 정점으로부터 무조건 11개 중에 답이 존재한다.
⏳ 회고
근데 틀렸다. 왜 틀렸지? 진짜 모르겠다