[20251110] BOJ / G4 / 점프 / 설진영 #1372
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/2253
🧭 풀이 시간
45분
👀 체감 난이도
✏️ 문제 설명
N개의 돌이 일렬로 놓여있고, 1번 돌에서 N번 돌까지 점프로 이동하는 문제
다익스트라 쓰긴했는데, BFS로 걍 풀리는 거 같음
🔍 풀이 방법
⏳ 회고
처음에 속도 범위를 N으로 하니까 메모리 초과남
굿