[20250718] BOJ / G4 / 두 동전 / 설진영 #496
Merged
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/16197
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
버튼을 누르면 두 동전이 동시에 같은 방향으로 이동함. 벽('#')에 부딪히면 그 자리에 멈춤. 목표는 10번 이하의 버튼으로 둘 중 하나만 보드 밖으로 떨어뜨리는 것. 둘 다 떨어지거나 둘 다 안 떨어지면 실패임.
🔍 풀이 방법
BFS로 최단 경로를 찾는 문제
(coin1_x, coin1_y, coin2_x, coin2_y, 버튼횟수)로 정의해서 탐색함.
⏳ 회고
이지피지