結果

問題 No.94 圏外です。(EASY)
ユーザー GoryudyumaGoryudyuma
提出日時 2018-06-29 18:07:39
言語 Scala(Beta)
(3.4.0)
結果
TLE  
実行時間 -
コード長 4,563 bytes
コンパイル時間 15,188 ms
コンパイル使用メモリ 259,996 KB
実行使用メモリ 64,336 KB
最終ジャッジ日時 2023-09-13 15:14:57
合計ジャッジ時間 46,540 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,043 ms
63,476 KB
testcase_01 AC 969 ms
63,436 KB
testcase_02 AC 962 ms
63,908 KB
testcase_03 AC 935 ms
62,816 KB
testcase_04 AC 1,032 ms
63,816 KB
testcase_05 AC 1,079 ms
64,064 KB
testcase_06 AC 1,109 ms
64,152 KB
testcase_07 AC 1,144 ms
63,880 KB
testcase_08 AC 1,178 ms
63,960 KB
testcase_09 AC 1,259 ms
64,232 KB
testcase_10 AC 1,264 ms
63,964 KB
testcase_11 AC 1,246 ms
64,064 KB
testcase_12 AC 1,263 ms
64,140 KB
testcase_13 AC 1,290 ms
63,984 KB
testcase_14 AC 1,275 ms
63,820 KB
testcase_15 AC 1,292 ms
63,856 KB
testcase_16 AC 1,278 ms
64,336 KB
testcase_17 AC 1,267 ms
64,084 KB
testcase_18 AC 1,283 ms
63,840 KB
testcase_19 TLE -
testcase_20 -- -
testcase_21 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Scanner

import scala.collection.Searching._
import scala.annotation.tailrec
import scala.collection.mutable
import scala.collection.immutable._
import scala.io.StdIn.readLine

class IUnionFind(val size: Int) {

  private case class Node(var parent: Option[Int], var treeSize: Int)

  private val nodes = Array.fill[Node](size)(new Node(None, 1))

  def union(t1: Int, t2: Int): IUnionFind = {
    if (t1 == t2) return this

    val root1 = root(t1)
    val root2 = root(t2)
    if (root1 == root2) return this

    val node1 = nodes(root1)
    val node2 = nodes(root2)

    if (node1.treeSize < node2.treeSize) {
      node1.parent = Some(t2)
      node2.treeSize += node1.treeSize
    } else {
      node2.parent = Some(t1)
      node1.treeSize += node2.treeSize
    }
    this
  }

  def connected(t1: Int, t2: Int): Boolean = t1 == t2 || root(t1) == root(t2)

  def root(t: Int): Int = nodes(t).parent match {
    case None => t
    case Some(p) => root(p)
  }
}

object Main {
  def solve(sc: => Scanner): Unit = {
    val N = sc.nextInt
    if (N == 0) (println(1)) else {
      val uf = new IUnionFind(N)
      val A = Array.fill(N)((sc.nextInt, sc.nextInt)).zipWithIndex
      for (i <- A) {
        for (j <- A) {
          if ((i._1._1 - j._1._1) * (i._1._1 - j._1._1) + (i._1._2 - j._1._2) * (i._1._2 - j._1._2) <= 100) {
            uf.union(i._2, j._2)
          }
        }
      }
      var ans = 0.0
      for (i <- A) {
        for (j <- A) {
          if (uf.connected(i._2, j._2)) {
            ans = math.max(ans, math.sqrt((i._1._1 - j._1._1) * (i._1._1 - j._1._1) + (i._1._2 - j._1._2) * (i._1._2 - j._1._2)))
          }
        }
      }
      println((ans + 2.0).formatted("%.20f"))
    }
  }

  def show(i: Int, j: Int, N: Int): String = {
    return (recursive(i, j, N) + 1).formatted("%03d")
  }

  def recursive(i: Int, j: Int, N: Int): Int = {
    if (i == 0) {
      j
    } else if (i == N - 1) {
      (N - 1) * 3 - j
    } else if (j == 0) {
      (N - 1) * 4 - i
    } else if (j == N - 1) {
      N + i - 1
    } else {
      recursive(i - 1, j - 1, N - 2) + (N - 1) * 4
    }
  }

  def recursive2(N: Long): String = {
    if (N == 0) ("") else (('a'.toInt + (N % 26)).toChar + recursive2(N / 26))
  }

  def check(A: Array[List[Int]]): Boolean = {
    A.map(_.size == 0).fold(true)((a, b) => a & b)
  }

  def shift(n: Long): Long = {
    if (n == 0) (0) else if (n == 1) (1) else (shift(n - 1) << 1)
  }

  def unShift(n: Long): Long = {
    if (n == 0) (0) else (unShift(n >> 1) + 1)
  }

  def gcd(i: Long, j: Long): Long = {
    if (i < j) (gcd(j, i)) else (if (j == 0) (i) else (gcd(j, i % j)))
  }

  def main(args: Array[String]): Unit = {
    val sc: Scanner = new Scanner(System.in)
    solve(sc)
  }
}

object Util {
  def getPermutation(begin: Long = 0): Stream[Long] =
    Stream.cons(begin, getPermutation(begin + 1))

  def getPrimeList(): Stream[Long] =
    getPrimeListRecursive(getPermutation(begin = 2))

  private def getPrimeListRecursive(A: Stream[Long]): Stream[Long] =
    Stream.cons(A.head, getPrimeListRecursive(A.tail.filter(_ % A.head != 0)))

  def fib(a: Long = 0, b: Long = 1, mod: Long = Long.MaxValue): Stream[Long] = a #:: fib(b % mod, (a + b) % mod, mod)
}

object ArabicRoman {

  type =?>[A, B] = PartialFunction[A, B]

  val codeTable = List(
    (1000, "M"), (900, "CM"), (500, "D"), (400, "CD"), (100, "C"),
    (90, "XC"), (50, "L"), (40, "XL"), (10, "X"), (9, "IX"), (5, "V"), (4, "IV"), (1, "I"))

  val arabicToRoman: (Int) =?> String = {
    case src if (src >= 1 && src <= 3999) => {

      def convert(left: Int, cont: String = "", code: List[(Int, String)] = codeTable): String = {
        val (unitVal, unitChar) = code.head
        left - unitVal match {
          case n if (n == 0) => cont + unitChar
          case n if (n > 0) => convert(n, cont + unitChar, code)
          case _ => convert(left, cont, code.tail)
        }
      }

      convert(src)
    }
  }

  val romanToArabic: (String) =?> Int = {
    case src if (Option(src).exists { s => {
      s.nonEmpty && ("""[^MDCLXVI]""".r.findFirstMatchIn(s.toUpperCase) == None)
    }
    }) => {

      def convert(left: String, cont: Int = 0, code: List[(Int, String)] = codeTable): Int = {
        val (unitVal, unitChar) = code.head
        left.splitAt(unitChar.length) match {
          case ("", _) => cont
          case (`unitChar`, tail) => convert(tail, cont + unitVal, code)
          case _ => convert(left, cont, code.tail)
        }
      }

      convert(src.toUpperCase())
    }
  }
}
0