[전현수] - 백도어, 주차장, 순위, 탑 #191
Merged
Conversation
This file contains 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
bngsh
approved these changes
Oct 15, 2023
Comment on lines
+47
to
+50
| pq.add(Bundle(0, 0)) | ||
| costTable[0] = 0 | ||
|
|
||
| while (pq.isNotEmpty()) { |
There was a problem hiding this comment.
현수님 코드보고 어디 틀렸는지 찾았습니다...
오늘의 교훈: 첫 노드를 따로 빼지 말고 (0, 0)으로 큐에 넣자...
Comment on lines
+80
to
+83
| parkingLot.forEachIndexed { index, carNum -> | ||
| if (index == 0 || carNum == 0) return@forEachIndexed | ||
| totalFee += priceInfo[index] * weightInfo[carNum] | ||
| } |
There was a problem hiding this comment.
저는 이경우를 아예 생각을 못해서 처리를 못해줬는데
문제에 모든 차가 1번 들어오고 한번 나간다, 입력이 2m개다라는 조건이 있어서 입력이 끝나면 항상 주차장도 대기큐도 텅텅스인가봐요
| } | ||
|
|
||
| println( | ||
| if (laserPosList.drop(1).all { it == 0 }) 0 |
There was a problem hiding this comment.
헉 이거 0 0 0 0 0 이렇게 출력하라는 게 아니라 0만 출력하라는 뜻이었나요?!
jhg3410
approved these changes
Oct 15, 2023
Comment on lines
+25
to
+28
| val parkingLot = IntArray(10001) | ||
|
|
||
| val priceInfo = IntArray(10001) | ||
| val weightInfo = IntArray(10001) |
|
|
||
| val (startIndex, curCost) = pq.poll() | ||
|
|
||
| if (costTable[startIndex] < curCost) continue |
jeeminimini
approved these changes
Oct 15, 2023
|
|
||
| var totalFee = 0 | ||
|
|
||
| val queue: Queue<Int> = LinkedList() |
There was a problem hiding this comment.
deque보다 linkedlist가 더 좋나요?? 👀
There was a problem hiding this comment.
@jeeminimini 성능은 더 구린 걸로 알고있어요!! ㅋㅋㅋㅋㅋ그냥 저거에 익숙해서 저것만 쓰고있긴합니다,,,
|
|
||
| val (startIndex, curCost) = pq.poll() | ||
|
|
||
| if (costTable[startIndex] < curCost) continue |
There was a problem hiding this comment.
오 이걸로 visited 처리를 해줄 수 있군요....!
jeeminimini
approved these changes
Oct 15, 2023
| for (k in 1 .. n) { | ||
| for (i in 1 .. n) { | ||
| for (j in 1 .. n) { | ||
| if (resultTable[i][k] == WIN && resultTable[k][j] == WIN) { |
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.
📌 from issue #190 📌
📋문제 목록📋
📍추가로 해결한 문제📍
📝메모
공유하고 싶은 정보, 새롭게 알게된 것, 문제를 풀면서 발생한 에로사항 등...자유롭게!