[소병희] - 최소 스패닝 트리, 카드 섞기, 경쟁적 전염, Coins #257
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
changed the title
bngsh
changed the title
bngsh
commented
May 12, 2024
| val nc = c + dc[d] | ||
| if (nr !in 0 until n || nc !in 0 until n) continue | ||
| if (tube[nr][nc] in 1 until tube[r][c]) continue | ||
| if (tube[nr][nc] > 0 && time[nr][nc] <= time[r][c]) continue |
There was a problem hiding this comment.
순간 헷갈렸는데 time[nr][nc]를 갱신하기 전이라 이 비교가 맞네요 허허
jhg3410
approved these changes
May 12, 2024
Comment on lines
+17
to
+37
| while(pq.isNotEmpty()) { | ||
| val (a, b, w) = pq.poll() | ||
|
|
||
| var parA = a | ||
| var parB = b | ||
|
|
||
| while(visited[parA] != parA) { | ||
| parA = visited[parA] | ||
| } | ||
| while(visited[parB] != parB) { | ||
| parB = visited[parB] | ||
| } | ||
|
|
||
| if (parA == parB) continue | ||
|
|
||
| if (parA < parB) { | ||
| visited[parB] = parA | ||
| } | ||
| else { | ||
| visited[parA] = parB | ||
| } |
There was a problem hiding this comment.
반례 제공도 감사드리고 병희님 코드 참고하면서 문제도 풀었습니다!!👍
Comment on lines
+31
to
+32
| if (tube[nr][nc] in 1 until tube[r][c]) continue | ||
| if (tube[nr][nc] > 0 && time[nr][nc] <= time[r][c]) continue |
There was a problem hiding this comment.
아 이 친구들이 번호의 우선순위와 이전 영역의 침범을 막는 코드군요!👍
soopeach
approved these changes
May 12, 2024
Comment on lines
+18
to
+23
| dp[0] = 1 | ||
| for(coin in coins) { | ||
| for(price in coin .. m) { | ||
| dp[price] += dp[price - coin] | ||
| } | ||
| } |
Comment on lines
+20
to
+37
| var parA = a | ||
| var parB = b | ||
|
|
||
| while(visited[parA] != parA) { | ||
| parA = visited[parA] | ||
| } | ||
| while(visited[parB] != parB) { | ||
| parB = visited[parB] | ||
| } | ||
|
|
||
| if (parA == parB) continue | ||
|
|
||
| if (parA < parB) { | ||
| visited[parB] = parA | ||
| } | ||
| else { | ||
| visited[parA] = parB | ||
| } |
| shuffle[i] = v.toInt() | ||
| } | ||
|
|
||
| for(i in 0 .. 1_000_000) { |
jeeminimini
approved these changes
May 13, 2024
Comment on lines
+34
to
+35
| tube[nr][nc] = tube[r][c] | ||
| time[nr][nc] = time[r][c] + 1 |
There was a problem hiding this comment.
time을 이용해서 순서를 정하는게 좋아보였습니다!
Comment on lines
+17
to
+37
| while(pq.isNotEmpty()) { | ||
| val (a, b, w) = pq.poll() | ||
|
|
||
| var parA = a | ||
| var parB = b | ||
|
|
||
| while(visited[parA] != parA) { | ||
| parA = visited[parA] | ||
| } | ||
| while(visited[parB] != parB) { | ||
| parB = visited[parB] | ||
| } | ||
|
|
||
| if (parA == parB) continue | ||
|
|
||
| if (parA < parB) { | ||
| visited[parB] = parA | ||
| } | ||
| else { | ||
| visited[parA] = parB | ||
| } |
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 #256 📌
📋문제 목록📋