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://school.programmers.co.kr/learn/courses/30/lessons/87946
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
각 던전마다 최소 입장 피로도와 소모 피로도가 있음. 2차원 배열로 주어짐.
각 던전은 하루에 한 번 탐험할 수 있음
현재 피로도 기준으로 최대 몇 개의 던전을 탐험할 수 있는지 구하라
🔍 풀이 방법
던전의 수가 최대 8개로 적기 때문에 완탐으로 가능한 모든 탐험 순서를 시도했다.
dfs를 써서 현재 피로도에서 입장 가능한 던전만 선택해 탐험하고, 방문 여부를 기록하며 최대 탐험 개수를 갱신했다.
⏳ 회고