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/14938
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
예은이가 임의의 지역에 떻어지고, 수색범위가 m일 때,
필드에서 얻을 수 있는 아이템의 최대 개수 구하기
🔍 풀이 방법
플로이드-워셜 사용
한 지점부터 각 지점까지 갈 수 있는 최소거리를 저장한 dist 배열을 만들고,
이후에 m보다 작은 지점들의 아이템 개수를 더해서 최대 개수 구함
⏳ 회고
각 지점별로 다익스트라 사용해서 푸는 풀이도 있는데, 그거로도 풀어봐야겠다