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/32203
🧭 풀이 시간
5분
👀 체감 난이도
✏️ 문제 설명
N명의 사람들로 M개의 모임이 진행된다.
각 사람은 남자 혹은 여자이고, i번째 모임에선 a[i]번 사람과 b[i]번 사람이 전화번호를 교환하여
연락 가능한 상태가 된다.세 사람 a, b, c에 대해 a와 b가 연락 가능하고 b와 c가 연락 가능하다면 a와 c도 연락 가능하다.
각 모임이 끝난 뒤에 서로 연락 가능한 남녀 쌍의 수를 구해보자.
🔍 풀이 방법
그래프 문제로 바꿔서 분리 집합으로 풀었다.
union연산에서 각 집합의 남자, 여자 수를 같이 고려해줬다.
⏳ 회고
분리 집합 기본급