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
1 participant
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.
PR Summary
<풀이 시간>
1시간+
<문제 회고>
처음엔 greedy로 접근하였다.
계속 틀려서 반례를 못 찾고 질문 게시판을 보고 greedy로 안 된다는 것을 깨달았다.
이후, 다들 BFS나 DFS로 풀었길래 해당 방법을 생각해봤는데 딱히 방법이 떠오르지 않았다.
입력 크기를 보고 완전탐색으로 해도 괜찮다고 느꼈다.
O($K \times (_7C_2)^2$ )로 잘 통과 된다.
허무했다. 골드 2라서 쫄았다.