[전현수] - 로봇 청소기, 보물섬, 센서, 합분해 #97
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
jhg3410
approved these changes
Feb 19, 2023
| NORTH(Position(-1, 0)) | ||
| } | ||
|
|
||
| private inner class Robot { |
Comment on lines
+142
to
+162
| with(robot) { | ||
| while (isNotStop()) { | ||
| // 우선 청소 | ||
| cleanUp() | ||
| // 주변에 청소가 안된 곳이 있다면 | ||
| if (isNotCleanedUpNear()) { | ||
| // 반시계 방향으로 회원 | ||
| rotate() | ||
| // 앞쪽이 청소되지 않은 칸일 경우 전진 | ||
| if (isFrontCleanedUp()) move() | ||
| } else { | ||
| // 뒤가 벽이라면 종료 | ||
| if (isBackWall()) { | ||
| turnOff() | ||
| // 뒤가 벽이 아니라면 후진 | ||
| } else { | ||
| moveBack() | ||
| } | ||
| } | ||
| } | ||
| } |
|
|
||
| if (nx in 0 until map.size && ny in 0 until map.first().size) { | ||
| if (map[nx][ny] == 0) { | ||
| map[nx][ny] = cost + 1 |
| diffArray.add(diffOfCensor) | ||
| } | ||
|
|
||
| println(diffArray.sortedByDescending { it }.drop(targetCnt - 1).sum()) |
bngsh
approved these changes
Feb 19, 2023
| } | ||
|
|
||
| // 서 남 동 북 | ||
| enum class Directions(val position: Position) { |
There was a problem hiding this comment.
입력으로 주어지는 방향값이 시계방향이길래 시계방향으로 만들었는데 말씀하신대로 그 뒤에 시뮬레이션 하는 내내 반시계로 도니까 반시계방향으로 만들면 편했겠네요!!
|
|
||
| repeat(rowCnt) { | ||
| val rowData = readln().map { | ||
| if (it == 'W') OCEAN else LAND |
There was a problem hiding this comment.
int형으로 바꿔서 거리를 맵 자체에 저장하신 게 멋진 설계네요!!
| diffArray.add(diffOfCensor) | ||
| } | ||
|
|
||
| println(diffArray.sortedByDescending { it }.drop(targetCnt - 1).sum()) |
There was a problem hiding this comment.
정렬이 빨리 될 거 같아서 pq로 했는데 poll을 k번하는 거 생각하면 리스트를 정렬하고 바로 drop하는 게 더 빠를 수도 있겠네요..!
jeeminimini
approved these changes
Feb 19, 2023
Comment on lines
+110
to
+114
| fun isNotStop() = isOn | ||
|
|
||
| fun turnOff() { | ||
| isOn = false | ||
| } |
| diffArray.add(diffOfCensor) | ||
| } | ||
|
|
||
| println(diffArray.sortedByDescending { it }.drop(targetCnt - 1).sum()) |
There was a problem hiding this comment.
이게 그냥 합이 되는군요...! 머리 한방 맞고 갑니다
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 #96 📌
📋문제 목록📋
📍추가로 해결한 문제📍
📝메모
우와... 골드 dp문제 처음 풀어봐요