[20250622] BOJ / G1 / 외판원 순회 / 이강현 #379
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
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/2098
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
특정한 도시에서 모든 도시를 순회하고 다시 처음 도시로 돌아오는데 걸리는 최소 비용 구하기
🔍 풀이 방법
비트마스킹 + dp
dp[거쳐간 도시][현재 도시]로 설정
⏳ 회고
순회는 어디서 시작하던 동일한 결과를 얻는 다는 점을 알았고
dp 문제는 for문 중첩을 어떻게 하는지에 따라 달라진다는 것을 알았다.