[20250725] BOJ / G4 / 거짓말 / 이준희 #544
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/1043
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
과장해서 말하는 것을 좋아하는 지민이가 파티에 가서 썰을 풀려고 합니다.
하지만 거짓말쟁이가 되기는 싫어서 진실을 아는 사람이 있는 파티에서는 과장해서 말할 수 없습니다.
진실을 아는 사람 목록과 각 파티에 참석하는 사람들이 주어질 때 과장해서 말할 수 있는 파티의 횟수를 구하는 문제입니다.
🔍 풀이 방법
분리집합, union / find 를 이용해서 풀었습니다.
진실 여부에 따라서 묶고 해당 파티에 진실 아는 사람이 있는지를 파악했습니다.
⏳ 회고
분리집합 오랜만에 풀어서 프로세스를 까먹을뻔 했습니다