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.
B: A, B를 multiset으로 만들고 각 employee마다 B개수-A개수
C: multiset에 tree들 저장하다가 제거는 upper_bound()로 범위 설정해서 전체제거. nlogn이라 통과 가능.
D: good int들을 담은 전체 배열을 미리 만들어두고 입력받은 정수번째 값 출력하는 방식 생각함. 근데 전체 배열을 어떻게 만들지에서 막힘.
끝나고 D를 찾아보니 BFS/DFS더군요..
그래프 문제가 이런 형식으로도 나올 수 있구나 알게 되었습니다