[20250822] BOJ / G3 / 연구소 3 / 김민진 #712
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.
🧷 문제 링크
연구소 3
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
존재하는 비활성 바이러스 중
M개를 임의로 활성화시켰을 때 모든 빈 칸을 바이러스로 채울 수 있는 최소 시간을 구하는 문제입니다.다 채우지 못하는 경우
-1을 출력합니다.🔍 풀이 방법
조합으로 활성화 시킬 바이러스를 구하고 이를 기반으로 너비우선탐색 진행하면 됩니다.
⏳ 회고
최소 시간 구할 때 기존에 바이러스가 있던 칸이 마지막이라면 이 부분은 제외하고 최솟값을 구해야 하는데 계속 포함시키는 바람에 20분? 30분? 날림..
로직 자체는 금방 나왔습니다.