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/21608
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
문제가 복잡하니 문제를 참고해주시길 바랍니다.
🔍 풀이 방법
진짜 빡구현 문제였습니다.
각 상어녀석들마다 모든 칸을 순회하면서 각 분기 (좋아하는애, 옆칸이 비었는지)를 판단해서 가장 높은 곳에 넣었습니다.
⏳ 회고
오랜만에 빡구현이었습니다.