[20251021] BOJ / G2 / 마피아 / 김수연 #1184
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/1079
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
참가자 짝수 -> 밤, 홀수 -> 낮
은진이가 마지막 마피아
마피아가 죽이면 유죄 지수 변경 -> i가 죽으면 j의 유죄 지수 + R[i][j]
낮에 유죄 지수 가장 높은 사람 죽임 -> 여러명이면 번호 가장 작은 사람 -> 유죄 지수 안변함
최대 몇 밤 지나는지 구하기
🔍 풀이 방법
백트래킹 사용
밤이랑 낮 나눠서 각 상황에 맞게 죽이는 법 나누고 dfs 쭉 돌림
isDead로 죽었는지 여부 확인 및 changeGuilty 함수로
⏳ 회고
JONNA 어렵네 에휴에휴에유휴엥흉휸애혼에홈ㅇ햐