[20250323] BOJ / G5 / 인내의 도미노 장인 호석 / 이강현#283
Merged
ShinHeeEul merged 1 commit intomainfrom Mar 23, 2025
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
2 participants
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/20165
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
격자 모양의 게임판에서 공격자는 도미노를 자꾸 무너뜨리고 수비자는 세움. 도미노는 그 높이에 따라 연쇄적으로 다른 도미노를 무너뜨릴 수 있고 수비자는 하나씩만 세울 수 있음. R개의 라운드 동안 무너뜨린 도미노의 개수랑 최종 상태를 출력
🔍 풀이 방법
구현, 재귀?
⏳ 회고
구현 문제인데 상하좌우로 탐색하고 연쇄반응을 재귀적으로 구현하였음.
현재 시점에서 멀리 떨어진, 근데 연쇄 범위에 존재하는 도미노에 접근할 때 좌표를 설정하는 것에 실수가 있었음.