[20251201] BOJ / P3 / 즉흥 여행 (Hard) / 권혁준 #1555
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/26157
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
정점 N개, 간선 M개인 그래프가 주어진다.
모든 정점을 방문할 수 있는 시작점들을 구해보자.
🔍 풀이 방법
SCC로 압축한DAG에서위상 정렬+DP로 방문 가능한 최대 점의 개수를 구해줬다.⏳ 회고
ez