feat: 2025-12-22 baekjoon 7569 문제 풀이 #118

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Open

daexvk wants to merge 1 commit into main from daewook/2025-12-22

Collaborator

daexvk commented Dec 21, 2025

✅ PR 요약

문제 플랫폼: baekjoon
문제 이름 및 번호: 7569
작성자: 김대욱

🔍 코드 설명

어떤 알고리즘을 사용했나요? bfs
시간복잡도 / 공간복잡도는 어떻게 되나요? O(N^3)

💡 리뷰 요청 사항

어떤 부분을 중점적으로 봐줬으면 하나요?
앞에서 풀었던 토마토 문제에서, 공간만 3차원으로 바뀐거라서 어렵지 않았따 !!


          feat: 2025-12-22 baekjoon 7569 문제 풀이

d4dd6b9

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet