[20250914] BOJ / G4 / 이분 그래프 / 이강현 #892
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/1707
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
그래프의 정점들을 두 개의 집합으로 나눌때, 인접한 두 정점이 같은 집합에 있지 않도록 할 수 있다면 YES, 아니라면 NO를 출력
🔍 풀이 방법
BFS
visited에서 0은 미방문, 두 집합은 1, -1로 표기하고 BFS 진행.
모든 정점의 인접 정점에 대해서 서로 다른 집합에 위치하도록 진행.
이때 방문한 정점이 인접한 정점과 같은 집합에 있게되면 바로 종료
⏳ 회고
뭔가 BFS인데 어려웠다.
이분 그래프라는것을 처음 풀어봐서 낯설었던게 컸다.