Open
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.
A: 문제가 5의 배수인데 대충 읽어서 몇 번 틀렸습니다.
B: 이전 부서 배열과 이후 부서 배열을 만들어서 차이를 출력했습니다.
C: priority_queue 를 사용해서 쉽게 풀었습니다.
D: dp로 접근했다가 답이 안 보여서 넘어갔습니다.
E : MST를 완성하고 dfs로 모든 경로의 비용을 계산해서 비교하려는 방식으로 구현했지만 시간이 부족해서 못했습니다. 커밋한 코드는 완성해서 AC 받은 코드입니다.