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/1486
🧭 풀이 시간
하루
👀 체감 난이도
✏️ 문제 설명
출발지에서 제한 시간내에 다녀올 수 있는 가장 높은 지점을 출력
🔍 풀이 방법
플로이드 방법을 통해서 풀어봤는데 출발지에서 다익스트라, 가장 높은 지점이 결정나면 다익스트라를 쓰는 방식으로 구해야할 듯함.
⏳ 회고
DFS,BFS가 아닌 새로운 탐색 알고리즘을 구현해봤는데 기본기가 부족해서 못풀겠음. 기본적인 다익스트라 문제를 여럿 풀어보고 재도전 할 것