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/14846
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
NxN 행렬에 1부터 10까지 자연수가 하나씩 들어가있음.
사각형 모양의 특정 영역에 서로 다른 자연수가 몇개 들어가 있는지 카운트
🔍 풀이 방법
누적합
한 칸에 들어갈 수 있는 자연수가 한정적이므로 각각에 대해서 누적합 배열을 생성
1의 누적,2의 누적, 3의 누적...
그리고 범위에 대해서 하나 이상 특정 자연수가 존재하면 카운트를 +1
⏳ 회고
범위에 대해서 어떻게 누적을 해야하나 맵을 모든 칸에 두어야 하나 이런 생각을 많이 했는데
1부터 10까지만 들어갈 수 있다는 것에서 각각에 누적합을 하면 된다는 아이디어가 참 좋은 것 같다.