본문 바로가기

코딩연습27

[백준] 최소비용 구하기 (1916)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/1916 성공(Adjacency List) import java.io.BufferedReader import java.io.InputStreamReader import java.util.* import kotlin.collections.ArrayList class Node : Comparable { var index = 0 var distance = 0 constructor(index: Int, distance: Int) { this.index = index this.distance = distance } override fun compareTo(other: Node): Int { return this.distance - other... 2020. 2. 12.
[백준] 최단경로 (1753)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/1753 실패 - 메모리초과(Adjacency Matrix) import java.io.BufferedReader import java.io.InputStreamReader fun main() = with(BufferedReader(InputStreamReader(System.`in`))){ val str = readLine().split(" ") val V = str[0].toInt() val E = str[1].toInt() val start = readLine().toInt() var graph: Array = Array( V+1 ) { IntArray( V+1 ) } for ( i in 1 until E+1 ) { val ne.. 2020. 2. 11.
[백준] 섬의 개수 (4963)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/4963 DFS import java.io.* import java.util.* var x = 0 var y = 0 val dx: IntArray = intArrayOf(-1,1,0,0,-1,1,-1,1) val dy: IntArray = intArrayOf(0,0,-1,1,-1,-1,1,1) var count = 0 var map: Array = arrayOf() var visited: Array = arrayOf() fun main() = with(BufferedReader(InputStreamReader(System.`in`))) { var str = readLine().split(" ") x = str[0].toInt() y .. 2020. 2. 4.
[백준] 케빈 베이컨 (1389)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/1389 문제 참고(Floyd Warshall) : https://hyeooona825.tistory.com/61 실패 import java.io.* import java.util.* var map: Array = arrayOf() var persons: Int = 0 val INF: Int = 10000000 fun main() = with(BufferedReader(InputStreamReader(System.`in`))) { var str = readLine().split(" ") persons = str[0].toInt() var net: Int = str[1].toInt() map = Array( persons ) { Int.. 2020. 2. 3.

티스토리툴바