[20250211] BOJ / 골드5 / 행성 탐사 / 설진영 #79
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
Seol-JY
changed the title
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/5549
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
행성에 3가지 지형이 있고, 특정 구간 좌표를 주면 그 구간 내 각 지형 개수 출력
🔍 풀이 방법
전형적인 2차원 누적합 문제인듯. 각 구간의 전체 누적합을 통해 각 모서리마다 더하고 빼다보면 답 완성
⏳ 회고
실수 하지말고 신중하게 풀자. 햇갈리면 그림을 그리자.