[20250725] BOJ / G5 / 보물섬 / 이강현 #541
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/2589
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
바다와 육지가 있음.
육지만 이동 가능함. 한번 이동하는데 1시간 걸림.
보물은 육지에서 서로 가장 먼 두 지점에 뭍혀있다고 할때,
두 보물을 얻기위해 걸리는 시간을 출력.
🔍 풀이 방법
BFS, 완탐
지도의 가로세로가 50이하라서 그냥 모든 위치에서 BFS 돌리면 됨.
⏳ 회고
반전없는 노잼 ez문제