[20250323] BOJ / G5 / 빗물 / 이강현 #284
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/14719
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
2차원 세계에서 쌓여있는 벽들 사이에 생길 수 있는 빗물의 개수를 출력
🔍 풀이 방법
구현
단순히 매 좌표마다 좌우를 모두 확인하여 빗물 개수를 세고 모든 좌표를 확인했을 때 카운트되는 빗물이 없다면 반복문 탈출하도록 구현
⏳ 회고
알고리즘을 배울수록 n^2은 나쁜거야! 이걸로 풀리게 내겠어? 라는 생각때문에 구현을 주저하는 경우가 많은 것 같다. 입력을 잘 살피고 가능하면 무지성으로 구현하는게 좋은듯..