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/12851
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
수빈이가 동생을 찾으려고 하는데 가장 빠른 시간이 몇 초 후인지, 그 가지수는 몇 가지인지 구하라.
🔍 풀이 방법
visited를 int로 해서 다익스트라처럼 풀었다. K위치일 때, visited[K] 시간이 초기값일 땐 해당 시간 값으로 초기화 하고 아니고 해당 시간과 같으면 count한다.
⏳ 회고
오랜만에 재밌었다.