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/14497
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
주난이가 초콜릿 가지고 있는 친구한테서 뺏으려고 함.
그래서 ㅈㄴ 뜀.
뛸때마다 파동이 일어서 상하좌우로 퍼짐.
파동은 이동하면 벽 만날때까지 계속 상하좌우로 퍼짐.
초콜릿에 파동이 도달할때까지 점프 횟수를 구하라.
🔍 풀이 방법
0-1 BFS
BFS인데 벽만나면 1증가, 안만나면 점프횟수 그대로 전달하되, 덱에 넣을때 증가되는경우 뒤에 넣고 아니면 앞에 넣음.
⏳ 회고
덱에 넣는 방식을 몰라서 삽질함. 히잉