[소병희] 케빈 베이컨의 6단계 법칙, 전구와 스위치, CCW, 함께 블록 쌓기 #174
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
Sep 11, 2023
| val n = readLine().toInt() | ||
| val origin = readLine().map { it == '1' } | ||
| val goal = readLine().map { it == '1' } | ||
| val arr = BooleanArray(n+1) |
Comment on lines
+21
to
+32
| for(k in 1..n) for(i in 1 .. n) for(j in 1 .. n) { | ||
| adj[i][j] = minOf(adj[i][k] + adj[k][j], adj[i][j]) | ||
| } | ||
|
|
||
| for(i in 1 .. n) { | ||
| adj[i][0] = 0 | ||
| for(j in 1 .. n) adj[i][0] += adj[i][j] | ||
| if (bacon > adj[i][0]) { | ||
| bacon = adj[i][0] | ||
| ans = i | ||
| } | ||
| } |
Comment on lines
16
to
21
| readLine().split(" ").forEach { | ||
| val j = it.toInt() | ||
| for(k in 0 .. h - j) { | ||
| dp[i+1][k + j] = (dp[i+1][k + j] + dp[i][k]) % MOD | ||
| } | ||
| } |
There was a problem hiding this comment.
입력을 받으면서 테이블을 갱신하는 건 생각치도 못했네요..
jhg3410
approved these changes
Sep 11, 2023
| val n = readLine().toInt() | ||
| val origin = readLine().map { it == '1' } | ||
| val goal = readLine().map { it == '1' } | ||
| val arr = BooleanArray(n+1) |
| arr[s+1] = arr[s+1].not() | ||
| } | ||
| } | ||
| if (arr[n-1] != goal[n-1]) cnt1 = INF |
Comment on lines
+21
to
+23
| for(k in 1..n) for(i in 1 .. n) for(j in 1 .. n) { | ||
| adj[i][j] = minOf(adj[i][k] + adj[k][j], adj[i][j]) | ||
| } |
jeeminimini
approved these changes
Sep 11, 2023
Comment on lines
+21
to
+23
| for(k in 1..n) for(i in 1 .. n) for(j in 1 .. n) { | ||
| adj[i][j] = minOf(adj[i][k] + adj[k][j], adj[i][j]) | ||
| } |
There was a problem hiding this comment.
플루이드 워셜인지 몰랐는데 이렇게도 풀 수 있군요 👍
| val n = readLine().toInt() | ||
| val origin = readLine().map { it == '1' } | ||
| val goal = readLine().map { it == '1' } | ||
| val arr = BooleanArray(n+1) |
| arr[s+1] = arr[s+1].not() | ||
| } | ||
| } | ||
| if (arr[n-1] != goal[n-1]) cnt1 = INF |
Comment on lines
17
to
20
| val j = it.toInt() | ||
| for(k in 0 .. h - j) { | ||
| dp[i+1][k + j] = (dp[i+1][k + j] + dp[i][k]) % MOD | ||
| } |
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 📌
📋문제 목록📋