[장희직] - 트리의 지름, 공유기 설치 #249
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
Apr 29, 2024
Comment on lines
+52
to
+81
| if (liveCount == 1) { | ||
| queue.add( | ||
| nowHps.first.copy( | ||
| hp1 = nowHps.first.hp1 - 9, | ||
| hp2 = nowHps.first.hp2 - 9, | ||
| hp3 = nowHps.first.hp3 - 9, | ||
| ) to nowHps.second + 1 | ||
| ) | ||
| } else if (liveCount == 2) { | ||
| val (hp1, hp2) = nowHps.first.getLiveHP() | ||
| for ((case1, case2) in listOf((9 to 3), (3 to 9))) { | ||
| queue.add( | ||
| nowHps.first.copy( | ||
| hp1 = hp1 - case1, | ||
| hp2 = hp2 - case2, | ||
| hp3 = 0 | ||
| ) to nowHps.second + 1 | ||
| ) | ||
| } | ||
| } else { | ||
| for (case in cases) { | ||
| queue.add( | ||
| nowHps.first.copy( | ||
| hp1 = nowHps.first.hp1 - case[0], | ||
| hp2 = nowHps.first.hp2 - case[1], | ||
| hp3 = nowHps.first.hp3 - case[2], | ||
| ) to nowHps.second + 1 | ||
| ) | ||
| } | ||
| } |
Comment on lines
+29
to
+36
| while (start <= end) { | ||
| val middle = (start + end) / 2 | ||
| if (canInstall(middle)) { // 설치가 가능하면 오른쪽을 본다. | ||
| start = middle + 1 | ||
| } else { // 설치가 안되면 왼쪽을 본다. | ||
| end = middle - 1 | ||
| } | ||
| } |
There was a problem hiding this comment.
직접 다 계산해서 이렇게 깔끔하게 나오도록 짜시다니 멋지네요
|
|
||
| import kotlin.math.min | ||
|
|
||
| class `스티커 재배치` { |
| nodes[child].add(root to distance) | ||
| } | ||
|
|
||
| fun bfs(start: Int): Pair<Int, Int> { |
jeeminimini
approved these changes
Apr 29, 2024
Comment on lines
+19
to
+43
| fun bfs(start: Int): Pair<Int, Int> { | ||
| visited.fill(element = false) | ||
| // 원소, 가중치 | ||
| queue.add(start to 0) | ||
| visited[start] = true | ||
| var maxDis = 0 | ||
| var maxNumber = 0 | ||
|
|
||
| while (queue.isNotEmpty()) { | ||
| val (number, sumDistance) = queue.removeFirst() | ||
| nodes[number].filter { visited[it.first].not() }.forEach { | ||
| queue.add(it.first to sumDistance + it.second) | ||
| visited[it.first] = true | ||
| } | ||
| if (sumDistance > maxDis) { | ||
| maxDis = sumDistance | ||
| maxNumber = number | ||
| } | ||
| } | ||
|
|
||
| return maxNumber to maxDis | ||
| } | ||
|
|
||
| val (number, _) = bfs(1) | ||
| println(bfs(number).second) |
|
|
||
| import kotlin.math.min | ||
|
|
||
| class `스티커 재배치` { |
Comment on lines
+26
to
+36
| var start = 1L | ||
| var end: Long = homes.last() - homes.first() | ||
|
|
||
| while (start <= end) { | ||
| val middle = (start + end) / 2 | ||
| if (canInstall(middle)) { // 설치가 가능하면 오른쪽을 본다. | ||
| start = middle + 1 | ||
| } else { // 설치가 안되면 왼쪽을 본다. | ||
| end = middle - 1 | ||
| } | ||
| } |
There was a problem hiding this comment.
이런 방식은 end에 1을 붙이지 않아도 되는군요 ~~
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 #248 📌
📋문제 목록📋
📍추가로 해결한 문제📍