[20250721] BAJ/G3/감시/김득호 #508
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/15683
🧭 풀이 시간
80분
👀 체감 난이도
✏️ 문제 설명
cctv마다 감시구역이 다르다.
5가지 종류의 cctv가 있는데
사각지대가 가장 적게 배치하는 최적을 찾는 문제
🔍 풀이 방법
최대 8개의 cctv가 존재하기 때문에
조합을 만들어서 구현했음
완전탐색
⏳ 회고
조합을 좀 늦게 생각했다.
이게 정해인지는 모르겠지만
백트래킹을 생각없이 구현하는것보다는 구현 난이도가 쉬웠다.
완탐 구현의 경우 어떻게 더 쉽게 구현할 수 있는지가 중요한것같다,.