import java.math.BigDecimal import java.util.* fun main(arr:Array) { val pointCount = readLine()!!.toInt() var list = (1..pointCount).map {id -> readLine()!!.split(" ").map { it.toLong() }.let { Point(id, it[0].toDouble(), it[1].toDouble()) } }.toMutableList() list.forEach { it.distanceStart = dist(it, list.first()) it.distanceGoal = dist(it, list.last()) } val startPoint = list.first() val goalPoint = list.last() list = list.filter { it.distanceGoal <= startPoint.distanceGoal && it.distanceStart <= goalPoint.distanceStart }.sortedBy { it.distanceStart }.toMutableList() val map = PriorityQueue(kotlin.Comparator { t, t2 -> t.distanceStart.compareTo(t2.distanceStart) }) map.add(list.first()) list.removeAt(0) for(p in list) { for(p2 in map) { val d = dist(p2, p) if(d <= p2.distanceStart) { p.distanceStart = p2.distanceStart break } else if(d < p.distanceStart) { p.distanceStart = d } } map.add(p) } println(goalPoint.distanceStart) } fun dist(p1:Point, p2:Point):Long { var dist = Math.pow(Math.abs(p1.x - p2.x), 2.toDouble()).toBigDecimal() dist += Math.pow(Math.abs(p1.y - p2.y), 2.toDouble()).toBigDecimal() var ret = bigSqrt(dist, 0.toBigDecimal(), dist) ret = (Math.ceil(ret.toDouble() / 10) * 10).toLong() return ret.toLong() } fun bigSqrt(num:BigDecimal, min:BigDecimal, max:BigDecimal):Long { val mid = (max+min)/2.toBigDecimal() if(max-min<= 2.toBigDecimal()) { val minl = min.toLong() val midl = mid.toLong() val maxl = max.toLong() if(minl * minl >= num.toLong()) { return minl } if(midl * midl >= num.toLong()) { return midl } if(maxl * maxl >= num.toLong()) { return maxl } return maxl + 1 } var newMin = min; var newMax = max if(mid * mid > num) { newMax = mid + 1.toBigDecimal() } else { newMin = mid } return bigSqrt(num, newMin, newMax) } class Point(val id:Int, val x:Double, val y:Double) { var distanceStart: Long = 0 var distanceGoal:Long = 0 }