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/1956
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
각 마을을 잇는 일방통행 도로를 따라서 운동을 하는데
운동을 하고 돌아오는 사이클 중 도로길이의 합이 가장 작은 경우를 구하는 문제입니다.
🔍 풀이 방법
플로이드-워셜을 이용하여 모든 마을에 대해 모든 경로를 구해놓고 map[i][j] + map[j][i] 가 존재하는 것 중 최소를 구했습니다.
⏳ 회고
골드 4답지 않은 문제였습니다.