[20250807] BOJ / G5 / 소셜 네트워킹 어플리케이션 / 김수연 #625
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
suyeun84
added
timeout ⌚
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/7511
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
유저의 수와 각 유저의 친구 관계가 주어질 때,
두 사람이 친구 관계 그래프상에서 경로가 존재하는지 여부 구하기
🔍 풀이 방법
유니온 파인드 사용
잘했는데 초기화를 똑디 안해서 오류 자꾸 났다..
⏳ 회고
초기화를 잘하자..