[20250930] BOJ / G4 / 뮤탈리스크 / 이준희 #1012
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/12869
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
뮤탈리스크의 쓰리쿠션이 각각 9, 3, 1 의 데미지를 입힐 때
SCV 를 모두 죽이는 최소 공격횟수를 구하는 문제입니다.
🔍 풀이 방법
BFS를 이용하여 공격할 수 있는 각 조합을 구하여 풀었습니다.
⏳ 회고
처음에는 배열로 풀었었는데 배열은 참조하면 원본값이 바뀐다는걸 간과했습니다 이런