[20250720] BOJ / G5 / Icy Perimeter / 설진영 #511
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/17025
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
N×N 그리드에서 '#'로 표현된 얼음덩어리들이 있을 때, 가장 큰 면적을 가진 덩어리의 면적과 둘레 구하기
면적이 같다면 둘레가 작은 것을 선택.
🔍 풀이 방법
DFS로 연결된 섬 탐색하기 -> 면젹 계산하면서 동시에 둘레도 계산
조건따라서 결과 출력
⏳ 회고
전형적인 DFS 섬찾기 문제인데, 둘레 계산이 추가