[20250701] BOJ / G3 / 웜홀 / 설진영 #406
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/1865
🧭 풀이 시간
35분
👀 체감 난이도
✏️ 문제 설명
도로와 웜홀이 있고, 도로는 양방향 웜홀은 단방향
TC개의 줄에 걸쳐서 특정 지점에서 돌아서 다시 자기한테 왔을 때, 시간이 줄어드는 경우가 있는지 판단하기
🔍 풀이 방법
벨만포드 문제
⏳ 회고
벨만포드를 안다면 쉽게 풀 수 있을 것 같다