[소병희] 표현 가능한 이진트리, 절댓값 힙, 치즈, 치킨 배달 #112
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
jeeminimini
approved these changes
Mar 12, 2023
| companion object { | ||
| fun solve(): Unit = with(BufferedReader(InputStreamReader(System.`in`))) { | ||
| val n = readLine().toInt() | ||
| val pq = PriorityQueue<Int> { a, b -> if (a + b == 0) a - b else abs(a) - abs(b) } |
There was a problem hiding this comment.
pq를 굉장히 아름답게 쓰시네요,, 항상 배우고 갑니당
Comment on lines
+34
to
+42
| fun checkSubTree(s: Int, e: Int, parent: Int) : Int { | ||
| val mid = (s + e) / 2 | ||
| val root = sb[mid] - '0' | ||
| if (root == 1 && parent == 0) return 0 | ||
| if (s == e) return 1 | ||
|
|
||
| if (checkSubTree(s, mid - 1, root) == 0) return 0 | ||
| return checkSubTree(mid + 1, e, root) | ||
| } |
jhg3410
approved these changes
Mar 12, 2023
Comment on lines
+34
to
+42
| fun checkSubTree(s: Int, e: Int, parent: Int) : Int { | ||
| val mid = (s + e) / 2 | ||
| val root = sb[mid] - '0' | ||
| if (root == 1 && parent == 0) return 0 | ||
| if (s == e) return 1 | ||
|
|
||
| if (checkSubTree(s, mid - 1, root) == 0) return 0 | ||
| return checkSubTree(mid + 1, e, root) | ||
| } |
|
|
||
| val houseCnt = house.size | ||
| val franchiseCnt = franchise.size | ||
| val distMap = Array(houseCnt) { h -> IntArray(franchiseCnt) { f -> house[h].calcDist(franchise[f]) } } |
soopeach
approved these changes
Mar 12, 2023
| val m = input() | ||
| val house = mutableListOf<Pair<Int, Int>>() | ||
| val franchise = mutableListOf<Pair<Int, Int>>() | ||
| var cityDist = Integer.MAX_VALUE |
There was a problem hiding this comment.
Int의 상수 대신 Interger의 상수를 사용하신 이유가 있으신가요??
There was a problem hiding this comment.
ㅇㅁㅇ 아뇨 자바랑 헷갈렸나봐요 ㅋㅋㅋㅋㅋㅋㅋㅋㅋㅋㅋㅋㅋㅋㅋ
| } | ||
|
|
||
| fun makeM(f: Int, i: Int, chickenDist: IntArray) { | ||
| if (f == franchiseCnt && i < m) return |
|
|
||
| for(i in numbers.indices) { | ||
| sb.clear() | ||
| sb.append(java.lang.Long.toBinaryString(numbers[i])) |
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 #111 📌
📋문제 목록📋