본문 바로가기

전체 글145

[백준] 특정한 최단 경로 (1504)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/1504 문제 참고 : https://stack07142.tistory.com/163 import java.io.BufferedReader import java.io.InputStreamReader import java.util.* import kotlin.collections.ArrayList var n: Int = 0 var e: Int = 0 var list: ArrayList = ArrayList() var distance: Array = arrayOf() class Node : Comparable { var index = 0 var cost = 0 constructor(index: Int, cost: Int) { this.i.. 2020. 2. 17.
[백준] 알고스팟 (1261)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/1261 문제 참고. : https://stack07142.tistory.com/131 다익스트라(adjacency list) import java.io.BufferedReader import java.io.InputStreamReader import java.util.* val dRow: IntArray = intArrayOf(-1,1,0,0) val dCol: IntArray = intArrayOf(0,0,-1,1) var ROW: Int = 0 var COL: Int = 0 var map: Array = arrayOf() var distance: Array = arrayOf() fun main() = with(BufferedRe.. 2020. 2. 17.
[백준] 파티 (1238)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/1238 문제 참고(플로이드와샬) : https://pangsblog.tistory.com/91 플로이드 와샬 import java.io.BufferedReader import java.io.InputStreamReader var n: Int = 0 var x: Int = 0 var route: Array = arrayOf() fun main() = with(BufferedReader(InputStreamReader(System.`in`))) { val nmx = readLine().split(" ") n = nmx[0].toInt() var m = nmx[1].toInt() x = nmx[2].toInt() route = Array.. 2020. 2. 17.
[백준] 최소비용 구하기 (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.
[백준] 경로 찾기 (11403)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/11403 문제 참고(플로이드 와샬) : https://6a68.tistory.com/13 문제 참고(DFS) : https://gist.github.com/jayden-lee/d7b858b63319b65ef2c8b2fef43d4f7b 문제 참고(BFS) : https://hees-dev.tistory.com/21 플로이드 와샬 import java.io.* import java.util.* var size: Int = 0 var route: Array = arrayOf() fun main() = with(BufferedReader(InputStreamReader(System.`in`))) { size = readLine().toIn.. 2020. 1. 30.
[배준] 바이러스 (2606)(Kotlin) 원본 문제 : https://www.acmicpc.net/problem/2606 문제 참고 : https://youjourney.tistory.com/132 import java.io.* import java.util.* var computerCount = 0 var graph: Array = arrayOf() val INF: Int = 100000 fun main() = with(BufferedReader(InputStreamReader(System.`in`))) { computerCount = readLine().toInt() graph = Array( computerCount + 1 ) { IntArray( computerCount + 1) } var conn = readLine().toInt() .. 2020. 1. 30.

티스토리툴바