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/27211
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
끝이 없이 회전되는 맵에서 0이면 빈칸, 1이면 숲일 때 빈칸끼리 묶이면 구역입니다.
이 때 순회하면서 총 구역의 갯수를 구하는 문제입니다.
🔍 풀이 방법
BFS를 이용해서 순회하면서 빈칸을 돌면서 방문처리 합니다.
1이 아닌 빈칸을 모두 돌았을 때 구역이 한개 추가됩니다.
전부 순회했을 경우에 구역 갯수를 출력하였습니다.
⏳ 회고
간단한 BFS문제였는데 원형이다보니 인덱스 생각을 했어야 했습니다.