Repository navigation
[W11] Ditto's solve CodeTree baggage conveyor belt - #66
Open
CryingDitto wants to merge 1 commit into
Open
CryingDitto wants to merge 1 commit into
CryingDitto wants to merge 1 commit into
Conversation
Contributor
🤖 PR 자동 분석
변경된 풀이
|
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.
💡 핵심 접근
1단계
vector<int> bagMoveList[][]를 통해 해당 위치에 가고 싶어하는 수하물의 번호를 vector로 받아두고, 무게와 수하물 번호 규칙에 따라 해당 위치에 갈 최종 후보Bag의doMove를 true로 설정doMove==true인 수하물)이 앞이 막혀서 이동을 못하지는 않는지 확인 후, 이동 못하면doMove = false로 업데이트remainCnt1 증가 (bagList안의 bag들 업데이트), 파손된 가방은 파손 목록에 bool값 표시2단계
posToBagNum)3단계
🔍 리뷰 요청