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
1 participant
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://school.programmers.co.kr/learn/courses/30/lessons/81302
🧭 풀이 시간
25분
👀 체감 난이도
✏️ 문제 설명
각 대기실별로 거리두기를 지키고 있는지 여부 구하기
대기실은 5개이며 크기는 5x5이고, 거리두기를 위해 거리가 2 이하로는 앉히면 안됨
단 파티션으로 막혀 있으면 가능
🔍 풀이 방법
bfs이용
대기실 하나씩 가져와서 사방향에 대해서 확인하되, 파티션으로 막혀 있으면 넘어가고, 아니면 false return
⏳ 회고
예외 잘 처리해서 구현하면 된다