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/20005
🧭 풀이 시간
90분
👀 체감 난이도
✏️ 문제 설명
M X N 지도에 문자로 보스와 각 플레이어와 장애물의 위치가 주어짐. 각 플레이어는 1초마다 이동 및 공격을 진행가능. 각 플레이어는 최단 거리로 보스몹에 도착하여 보스를 공격. 이때 모든 플레이어는 동시에 공격하고 한대라도 때릴 시 전리품을 받음. 전리품을 받는 플레이어의 수를 구하는 문제
🔍 풀이 방법
BFS를 잘 적용하고 플레이어들의 도착정보와 데미지를 잘 이용해서 분기를 잘 나누는게 중요
⏳ 회고
BFS가 점점 익숙해지고 있다. 한번에 잘 짰지만 방문처리를 안 해줘서 메모리 초과가.... 어쨌든 해결!