[20251205] BOJ / G2 / Escape Room / 김민진 #1588
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.
🧷 문제 링크
Escape Room
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
행 * 열 = 현재 위치한 셀의 수인 셀로 이동 가능할 때(1, 1)에서(M, N)으로 이동 가능한가?🔍 풀이 방법
약수 구해서 bfs 돌리면 됨
시간 고려해서
i * i까지만 확인해주고 그 반대의 경우도 확인 필요⏳ 회고
셀에 중복된 값이 들어갈 수 있어서 해당 숫자를 확인했는지 저장하는 boolean 배열 선언함
세 배 빨라짐 굿