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/14502
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
연구소의 지도와 벽, 유출된 바이러스가 주어질 때
3개의 추가벽을 설치하여 확보할 수 있는 안전지대의 최댓값을 구하는 문제입니다.
🔍 풀이 방법
3개의 벽을 설치해야 하므로 조합을 이용해서 3개의 벽 조합을 구하고
각 케이스마다 BFS 를 활용하여 바이러스를 퍼트린 후
바이러스가 퍼지지 않은 구역을 세어가며 최댓값을 갱신했습니다.
⏳ 회고
구현문제는 손이 안가서 미루고 미루다 풀었는데 역시 손이 안갈만 한 것 같습니다