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
1 participant
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.
🧷 문제 링크
링크
🧭 풀이 시간
360 분
👀 체감 난이도
✏️ 문제 설명
로봇 청소기가 돌아간다. 장애물은 건너뛸 수 없다. 여러 군데에 먼지가 흩뿌려져있는데 최단 거리로 이동해서 모든 먼지를 흡입해라.
🔍 풀이 방법
BFS로 먼지들 간의 거리를 구하고 나면, 외판원 순회랑 같은 문제가 된다.
⏳ 회고
비트 마스킹 재귀로 하는 법좀 연습좀 하자. 이거 못해서 2시간 잡아먹혔다.