Merged
Conversation
Contributor
|
540분이요? |
Contributor
Author
다시 태어나도 못 풀듯...... |
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
3 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/12946
🧭 풀이 시간
540분
👀 체감 난이도
✏️ 문제 설명
육각 보드에 겹치지 않게 색을 몇 개나 칠할 수 있을까요?
🔍 풀이 방법
이분 그래프로 풀다가, 두 개로 색칠 못하면 3을 리턴
육각형에서는 최대가 3이래요. 저는 몰랐어요. 그래서 너무 어려웠어요.
⏳ 회고
arr[nx][ny] = 3 - arr[current[0]][current[1]];라는 아이디어가 좋았다.