[소병희] 연구소, 미세먼지 안녕!, 친구비, 드래곤 커브 #124
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
Mar 26, 2023
Comment on lines
+40
to
+44
| for(i in 0 until g) { | ||
| r += dr[(d + curves[i]) % 4] | ||
| c += dc[(d + curves[i]) % 4] | ||
| isDragon[r][c] = true | ||
| } |
Comment on lines
+67
to
+83
| for(p in 0 .. 1) { | ||
| ni = purifier + p | ||
| nj = 0 | ||
| for(d in 0 until 4) { | ||
| while(ni + dr[d] * flip in rRange[p] && nj + dc[d] in 0 until c) { | ||
| nroom[ni][nj] = nroom[ni + dr[d] * flip][nj + dc[d]] | ||
| ni += dr[d] * flip | ||
| nj += dc[d] | ||
| } | ||
| } | ||
| nroom[purifier + p][1] = 0 | ||
| nroom[purifier + p][0] = 0 | ||
| flip *= -1 | ||
| } | ||
|
|
||
| copy(room, nroom) | ||
| } |
Comment on lines
+29
to
+33
| val (p1, p2) = readLine().split(" ").map { getParent(it.toInt()) } | ||
| if (p1 != p2) { | ||
| parent[p2] = p1 | ||
| cost[p1] = cost[p1].coerceAtMost(cost[p2]) | ||
| } |
jeeminimini
approved these changes
Mar 26, 2023
Comment on lines
+30
to
+37
| g = 2.0.pow(it[3].toInt()).toInt() | ||
| } | ||
|
|
||
| while(curves.size < g) { | ||
| for(i in curves.size - 1 downTo 0) { | ||
| curves.add((curves[i] + 1) % 4) | ||
| } | ||
| } |
Comment on lines
+37
to
+41
| fun copy(a: Array<IntArray>, b: Array<IntArray>) { | ||
| for(i in 0 until r) for(j in 0 until c) { | ||
| a[i][j] = b[i][j] | ||
| } | ||
| } |
There was a problem hiding this comment.
copy를 써서 그런가?? 시간이 훠어얼씬 적게 드시네요??
Comment on lines
+62
to
+72
| fun putUpWall(i: Int, rest: Int) { | ||
| if (rest == 0) return spreadVirus() | ||
|
|
||
| if (lab[i / m][i % m] == BLANK) { | ||
| lab[i / m][i % m] = WALL | ||
| putUpWall(i + 1, rest - 1) | ||
| lab[i / m][i % m] = BLANK | ||
| } | ||
|
|
||
| if (i + rest < n * m) putUpWall(i + 1, rest) | ||
| } |
There was a problem hiding this comment.
Int 하나로 2차원 리스트를 도는법 배워갑니다 👍
soopeach
approved these changes
Mar 26, 2023
Comment on lines
+34
to
+36
| for(i in curves.size - 1 downTo 0) { | ||
| curves.add((curves[i] + 1) % 4) | ||
| } |
Comment on lines
+37
to
+41
| fun copy(a: Array<IntArray>, b: Array<IntArray>) { | ||
| for(i in 0 until r) for(j in 0 until c) { | ||
| a[i][j] = b[i][j] | ||
| } | ||
| } |
There was a problem hiding this comment.
배열을 미리 만들고 인덱스 기준으로 탐색하고 갱신하니까 훨씬 빠르네요!
Comment on lines
+29
to
+33
| val (p1, p2) = readLine().split(" ").map { getParent(it.toInt()) } | ||
| if (p1 != p2) { | ||
| parent[p2] = p1 | ||
| cost[p1] = cost[p1].coerceAtMost(cost[p2]) | ||
| } |
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 #120 📌
📋문제 목록📋