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/14500
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
여러가지 모형 중 1개를 덮었을 때 덮는 부분의 수의 총합을 구하는 문제입니다.
🔍 풀이 방법
4개의 도형은 4칸 dfs를 사용하면 만족할 수 있었고
나머지 1개의 도형은 십자 모양으로 하드코딩한 후 최소값 빼는 식으로 계산했습니다
⏳ 회고
4가지 모형을 구하는 방식을 떠올릴 때 dfs 인것을 떠올릴 수 있느냐 없느냐에 따라 다른 것 같습니다 저는 꽤 오래걸렸습니다