[장희직] - 항체 인식, 토마토, 우체국, 문자열 게임 2 #223
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
soopeach
approved these changes
Mar 16, 2024
| @@ -0,0 +1,43 @@ | |||
| package heejik.`54week` | |||
|
|
|||
| import kotlin.coroutines.suspendCoroutine | |||
There was a problem hiding this comment.
ㅋㅋㅋㅋ 따로 테스트할 코드를 짜다가,, 들어갔네요😅
|
|
||
| answers.forEach { | ||
| println( | ||
| if (it.first == Int.MAX_VALUE) -1 |
There was a problem hiding this comment.
어차피 한번에 둘 다 갱신이 되니까 한 번만 확인해보면 되는군요,,,
Comment on lines
+38
to
+39
| answer3 = min(answer3, it[i + k - 1] - it[i] + 1) | ||
| answer4 = max(answer4, it[i + k - 1] - it[i] + 1) |
| package heejik.`54week` | ||
|
|
||
|
|
||
| // https://velog.io/@yunlee/BOJ-2141%EB%B2%88-%EC%9A%B0%EC%B2%B4%EA%B5%AD-Java |
Comment on lines
+37
to
+58
| while (deque.isNotEmpty()) { | ||
| repeat(tmpRipeCount) { | ||
| val (x, y) = deque.removeFirst() | ||
| for (i in 0..3) { | ||
| val nx = x + dx[i] | ||
| val ny = y + dy[i] | ||
| if (nx in 0 until m && ny in 0 until n && board[nx][ny] == 0) { | ||
| nextDeque.add(Pos(nx, ny)) | ||
| board[nx][ny] = 1 | ||
| ripeCount++ | ||
| nextRipeCount++ | ||
| isRipen = true | ||
| } | ||
| } | ||
| } | ||
| tmpRipeCount = nextRipeCount | ||
| nextRipeCount = 0 | ||
| deque.addAll(nextDeque) | ||
| nextDeque.clear() | ||
| if (isRipen) day++ | ||
| isRipen = false | ||
| } |
There was a problem hiding this comment.
전형적인 틀을 벗어나 뚝딱 변수들 추가해서 조건을 맞추시는게 대단합니다..!
jeeminimini
approved these changes
Mar 16, 2024
| var isRipen = false | ||
|
|
||
| while (deque.isNotEmpty()) { | ||
| repeat(tmpRipeCount) { |
| package heejik.`54week` | ||
|
|
||
|
|
||
| // https://velog.io/@yunlee/BOJ-2141%EB%B2%88-%EC%9A%B0%EC%B2%B4%EA%B5%AD-Java |
bngsh
approved these changes
Mar 16, 2024
| @@ -0,0 +1,43 @@ | |||
| package heejik.`54week` | |||
|
|
|||
| import kotlin.coroutines.suspendCoroutine | |||
| allSum += a | ||
| } | ||
|
|
||
| populations.sortedBy { it.first }.forEach { |
There was a problem hiding this comment.
맨날 정렬은 무지성 우선순위큐 써서 고차함수를 잊고 살았네요...깔끔쓰
Comment on lines
+37
to
+58
| while (deque.isNotEmpty()) { | ||
| repeat(tmpRipeCount) { | ||
| val (x, y) = deque.removeFirst() | ||
| for (i in 0..3) { | ||
| val nx = x + dx[i] | ||
| val ny = y + dy[i] | ||
| if (nx in 0 until m && ny in 0 until n && board[nx][ny] == 0) { | ||
| nextDeque.add(Pos(nx, ny)) | ||
| board[nx][ny] = 1 | ||
| ripeCount++ | ||
| nextRipeCount++ | ||
| isRipen = true | ||
| } | ||
| } | ||
| } | ||
| tmpRipeCount = nextRipeCount | ||
| nextRipeCount = 0 | ||
| deque.addAll(nextDeque) | ||
| nextDeque.clear() | ||
| if (isRipen) day++ | ||
| isRipen = false | ||
| } |
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 #220 📌
📋문제 목록📋
📍추가로 해결한 문제📍