[20250317] BOJ / G2 / 통나무 옮기기 / 권혁준 #252
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/1938
🧭 풀이 시간
25분
👀 체감 난이도
✏️ 문제 설명
통나무는 일렬로 세 칸을 차지한다.
상하좌우 이동 or 회전을 사용해서 목적지로 통나무를 옮기는 최소 동작 횟수를 구해보자.
🔍 풀이 방법
[사용한 알고리즘]
통나무가 수직으로 뻗어있는 경우를 0, 수평으로 뻗어있는 경우를 1로 두고 3차원 BFS (NN2)를 수행했다.
⏳ 회고
구현이 너무 많아서 틀릴까봐 무서웠다