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/25308
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
8개의 능력치를 나타내는 방사형 그래프가 있는데 이 능력치의 순서에 따라 오목 다각형 혹은 볼록 다각형이 된다. 이때 볼록 다각형이 되는 경우의 수를 구하기
🔍 풀이 방법
모든 배치 순서를 백트래킹을 이용하여 구하고 각 꼭짓점에서 좌우 꼭짓점으로 만들어지는 직선에 y=x 그래프를 그렸을 때 생기는 교점을 이용하여 거리를 구함. 이때 구해진 거리보다 해당 꼭짓점에서의 능력치가 작으면 오목 그래프, 크면 볼록 그래프임.
⏳ 회고
수학식이 간단하고 최적화할 필요없어서 그리 어렵진 않았음.