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.
🧷 문제 링크
철로
🧭 풀이 시간
70분
👀 체감 난이도
✏️ 문제 설명
길이
d의 철로를 놓을 때 그 철로만 가지고도 집-직장 다닐 수 있는 루트의 최대값🔍 풀이 방법
끝점을 기준으로 두고
start를 정해서start ~ end내부에 포함되는 루트만 큐에 남깁니다.우선순위 큐를 사용했는데 관성적으로 시작점 기준으로 정렬해서 계속 틀렸습니다.
끝점이 기준이라 끝점 기준으로 진행해야합니다,,
큐 개어렵네요
⏳ 회고
ㅋㅋ 커밋 없애는 거 실패햇고요.. 우울하네요..