[20251119] BOJ / G5 / 상어 초등학교 / 설진영 #1454
Merged
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/21608
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N×N 교실에 N^2 명의 학생을 배치 규칙에 따라 앉히고 만족도 총합을 구하는 문제
🔍 풀이 방법
Map으로 각 학생의 좋아하는 학생 목록 저장
-> 학생 순서대로 모든 빈 칸 탐색하며 우선순위에 따라 최적 위치 선택
-> 배치 완료 후 인접한 좋아하는 학생 수에 따라 만족도 계산
⏳ 회고
우선순위 잘 처리해서 빡구현함