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/17071
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
수빈이와 동생이 동시에 이동하는데 언제 만날 수 있을까?
🔍 풀이 방법
기존 BFS와 같은데 처리해야 할 건 visited의 형태
visited[위치][시간]인데 시간은 홀짝성을 띔그럴 수 있는 이유는 수빈이가 앞뒤로 왔다갔다 하면서 동생을 기다릴 수 있기 때문이다.
⏳ 회고
수빈이가 앞뒤로 왔다갔다 하는 건 참신했다. set으로 visited를 처음에 처리했는데 시간초과가 났다. visited에 대한 상태 정의를 고려했는데 홀짝성은 몰랐네.