[전현수] - 케빈 베이컨의 6단계 법칙, 함께 블록 쌓기, 전구와 스위치, CCW #171
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
Sep 11, 2023
Comment on lines
+30
to
+44
| val first = (0..2).run { | ||
| var triangle = 0 | ||
| this.forEach { index -> | ||
| triangle += p[index % 3].x * p[(index + 1) % 3].y | ||
| } | ||
| triangle | ||
| } | ||
|
|
||
| val second = (1..3).run { | ||
| var triangle = 0 | ||
| this.forEach { index -> | ||
| triangle += p[index % 3].y * p[(index + 1) % 3].x | ||
| } | ||
| triangle | ||
| } |
| } | ||
|
|
||
| when { | ||
| firstCase.contentEquals(targetState) -> { |
There was a problem hiding this comment.
Any의 equals 때문에 머리가 아프네요.....아무리 공부해도 어렵다 코틀린..
Comment on lines
+72
to
+85
| private fun Array<String>.switch(pos: Int) { | ||
| when (pos) { | ||
| bulbCnt - 1 -> { | ||
| this.singleSwitch(pos - 1) | ||
| this.singleSwitch(pos) | ||
| } | ||
|
|
||
| else -> { | ||
| this.singleSwitch(pos - 1) | ||
| this.singleSwitch(pos) | ||
| this.singleSwitch(pos + 1) | ||
| } | ||
| } | ||
| } |
There was a problem hiding this comment.
이 문제 풀이보고 코드가 너무 예뻐서 감탄했습니다
특히 이 스위치 함수가 아주 야무지네요
Comment on lines
+37
to
+49
| for (i in 1..studentCnt) { | ||
| for (j in 1..targetHeight) { | ||
| dp[i][j] += dp[i - 1][j] | ||
| dp[i][j] %= 10007 | ||
|
|
||
| studentInfo[i].forEach { blockHeight -> | ||
| val target = j - blockHeight | ||
| if (target < 0) return@forEach | ||
| dp[i][j] += dp[i - 1][target] | ||
| dp[i][j] %= 10007 | ||
| } | ||
| } | ||
| } |
There was a problem hiding this comment.
이중 for문 깔꼼하네요!! dp가 원래 이렇게 깔끔한 문젠데 왜 매번 지저분하게 풀어질까요..ㅋㅋㅋㅋㅋ
jeeminimini
approved these changes
Sep 11, 2023
Comment on lines
+72
to
+85
| private fun Array<String>.switch(pos: Int) { | ||
| when (pos) { | ||
| bulbCnt - 1 -> { | ||
| this.singleSwitch(pos - 1) | ||
| this.singleSwitch(pos) | ||
| } | ||
|
|
||
| else -> { | ||
| this.singleSwitch(pos - 1) | ||
| this.singleSwitch(pos) | ||
| this.singleSwitch(pos + 1) | ||
| } | ||
| } | ||
| } |
| } | ||
| } | ||
|
|
||
| println(dp[studentCnt][targetHeight] % 10007) |
jhg3410
approved these changes
Sep 11, 2023
Comment on lines
+23
to
+28
| readln().split(" ") | ||
| .map { it.toInt() } | ||
| .run { | ||
| Point(first(), last()) | ||
| } | ||
| } |
Comment on lines
+72
to
+85
| private fun Array<String>.switch(pos: Int) { | ||
| when (pos) { | ||
| bulbCnt - 1 -> { | ||
| this.singleSwitch(pos - 1) | ||
| this.singleSwitch(pos) | ||
| } | ||
|
|
||
| else -> { | ||
| this.singleSwitch(pos - 1) | ||
| this.singleSwitch(pos) | ||
| this.singleSwitch(pos + 1) | ||
| } | ||
| } | ||
| } |
| dp[i][j] += dp[i - 1][j] | ||
| dp[i][j] %= 10007 | ||
|
|
||
| studentInfo[i].forEach { blockHeight -> |
There was a problem hiding this comment.
studentInfo 에 미리 입력을 저장하고 하니 보기 좋네요!!
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 #170 📌
📋문제 목록📋
📍추가로 해결한 문제📍
📝메모
공유하고 싶은 정보, 새롭게 알게된 것, 문제를 풀면서 발생한 에로사항 등...자유롭게!