[20250816] BOJ / G3 / 소가 길을 건너간 이유 6 / 권혁준#675
Merged
ShinHeeEul merged 1 commit intomainfrom Aug 16, 2025
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
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/14466
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
N*N크기의 격자에 K마리의 소가 있고, 소들은 인접한 칸으로 이동이 가능하다.
특정 K개의 인접한 칸 쌍에 길이 설치된다.
길을 지나지 않으면 만날 수 없는 소의 쌍 수를 구해보자.
🔍 풀이 방법
인접하다는 걸 간선으로 보면, 간선 가중치를 0 혹은 1로 설정할 수 있다.
이렇게 해놓고 각 소마다 0-1 BFS를 돌려서, 거리가 0이 아닌 수들을 세어줬다.
⏳ 회고
음메