[장희직] - 주차장, 순위, 탑 #194
Merged
[장희직] - 주차장, 순위, 탑 #194
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
jeeminimini
approved these changes
Oct 15, 2023
Comment on lines
+18
to
+25
| results.map { it.toResult() }.forEach { result -> | ||
| wins[result.winner].add(result.loser) | ||
| wins[result.winner].addAll(wins[result.loser]) | ||
|
|
||
| wins.filter { result.winner in it }.forEach { | ||
| it.addAll(wins[result.winner]) | ||
| } | ||
| } |
There was a problem hiding this comment.
플루이드 워셜을 안하고도 이런식으로 구할 수 있군요 👍 👍
| } | ||
| } else { // 주차 빼내기 | ||
| val outCar = order.absoluteValue | ||
| val parkingLot = parkingLotsCars.indexOfFirst { it == outCar } // 주차 뺄 자리 찾기 |
There was a problem hiding this comment.
그냥 indexOf하면 first가 안나오나요? 😮
There was a problem hiding this comment.
indexOf 함수엔 제가 원하는 파라미터를 받는 친구가 없었어서 ㅠ
There was a problem hiding this comment.
println(listOf(5,1,1).indexOf(1))
---
ouput
1first 가 나오네요!
| roads = MutableList(n) { mutableListOf() } | ||
| repeat(m) { | ||
| val (a, b, t) = readLine().split(' ').map { it.toInt() } | ||
| if (a in cant || b in cant) return@repeat |
There was a problem hiding this comment.
오 1이면 아예 roads에 넣어주지 않아주면 깔끔하겠네요 👍 👍
soopeach
approved these changes
Oct 15, 2023
Comment on lines
+24
to
+26
| readLine().split(' ').map { it.toInt() }.forEachIndexed { index, it -> | ||
| if (it == 1 && index != n - 1) cant.add(index) | ||
| } |
There was a problem hiding this comment.
오 아예 입력받을 때 요렇게 넥서스를 배제할 수도 있겠군요
Comment on lines
+17
to
+20
| if (priorTops.isEmpty()) { | ||
| priorTops.add(top) | ||
| return@forEachIndexed | ||
| } |
bngsh
approved these changes
Oct 15, 2023
| roads = MutableList(n) { mutableListOf() } | ||
| repeat(m) { | ||
| val (a, b, t) = readLine().split(' ').map { it.toInt() } | ||
| if (a in cant || b in cant) return@repeat |
Comment on lines
+17
to
+35
| // win | ||
| results.map { it.toResult() }.forEach { result -> | ||
| wins[result.winner].add(result.loser) | ||
| wins[result.winner].addAll(wins[result.loser]) | ||
|
|
||
| wins.filter { result.winner in it }.forEach { | ||
| it.addAll(wins[result.winner]) | ||
| } | ||
| } | ||
|
|
||
| // lose | ||
| results.map { it.toResult() }.forEach { result -> | ||
| loses[result.loser].add(result.winner) | ||
| loses[result.loser].addAll(loses[result.winner]) | ||
|
|
||
| loses.filter { result.loser in it }.forEach { | ||
| it.addAll(loses[result.loser]) | ||
| } | ||
| } |
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 #190 📌
📋문제 목록📋