結果

問題 No.955 ax^2+bx+c=0
ユーザー GoryudyumaGoryudyuma
提出日時 2020-01-04 19:42:20
言語 Scala(Beta)
(3.4.0)
結果
WA  
実行時間 -
コード長 8,047 bytes
コンパイル時間 13,172 ms
コンパイル使用メモリ 275,580 KB
実行使用メモリ 64,192 KB
最終ジャッジ日時 2024-11-22 21:28:16
合計ジャッジ時間 134,881 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 925 ms
63,900 KB
testcase_02 AC 884 ms
63,176 KB
testcase_03 AC 876 ms
63,376 KB
testcase_04 AC 888 ms
63,164 KB
testcase_05 AC 881 ms
63,008 KB
testcase_06 AC 896 ms
62,896 KB
testcase_07 AC 902 ms
62,828 KB
testcase_08 AC 889 ms
63,200 KB
testcase_09 AC 890 ms
63,064 KB
testcase_10 AC 891 ms
63,300 KB
testcase_11 AC 916 ms
63,392 KB
testcase_12 AC 884 ms
63,216 KB
testcase_13 AC 938 ms
63,328 KB
testcase_14 AC 932 ms
63,936 KB
testcase_15 AC 934 ms
64,024 KB
testcase_16 AC 951 ms
64,048 KB
testcase_17 AC 947 ms
63,868 KB
testcase_18 AC 958 ms
64,036 KB
testcase_19 AC 953 ms
64,132 KB
testcase_20 AC 942 ms
63,888 KB
testcase_21 AC 958 ms
63,864 KB
testcase_22 AC 958 ms
63,752 KB
testcase_23 AC 940 ms
63,952 KB
testcase_24 AC 952 ms
63,608 KB
testcase_25 AC 941 ms
64,128 KB
testcase_26 AC 944 ms
64,044 KB
testcase_27 AC 935 ms
63,884 KB
testcase_28 AC 931 ms
63,916 KB
testcase_29 AC 948 ms
63,920 KB
testcase_30 AC 938 ms
63,876 KB
testcase_31 AC 941 ms
64,000 KB
testcase_32 AC 917 ms
63,884 KB
testcase_33 AC 910 ms
63,900 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 AC 955 ms
63,864 KB
testcase_63 WA -
testcase_64 AC 899 ms
63,300 KB
testcase_65 WA -
testcase_66 AC 900 ms
63,088 KB
testcase_67 AC 946 ms
64,048 KB
testcase_68 AC 914 ms
63,180 KB
testcase_69 AC 956 ms
63,908 KB
testcase_70 WA -
testcase_71 AC 902 ms
63,252 KB
testcase_72 AC 896 ms
63,160 KB
testcase_73 AC 951 ms
63,880 KB
testcase_74 AC 942 ms
64,032 KB
testcase_75 AC 903 ms
63,144 KB
testcase_76 AC 885 ms
63,076 KB
testcase_77 WA -
testcase_78 WA -
testcase_79 WA -
testcase_80 AC 904 ms
63,152 KB
testcase_81 AC 950 ms
63,832 KB
testcase_82 AC 961 ms
63,880 KB
testcase_83 AC 954 ms
63,888 KB
testcase_84 AC 951 ms
63,892 KB
testcase_85 AC 948 ms
64,108 KB
testcase_86 AC 954 ms
63,780 KB
testcase_87 AC 949 ms
64,096 KB
testcase_88 AC 945 ms
63,896 KB
testcase_89 AC 933 ms
63,828 KB
testcase_90 AC 947 ms
64,052 KB
testcase_91 AC 944 ms
63,728 KB
testcase_92 AC 899 ms
63,256 KB
testcase_93 AC 895 ms
63,104 KB
testcase_94 AC 939 ms
63,868 KB
testcase_95 AC 946 ms
63,920 KB
testcase_96 AC 957 ms
63,740 KB
testcase_97 AC 953 ms
64,096 KB
testcase_98 AC 952 ms
63,972 KB
testcase_99 AC 958 ms
64,040 KB
testcase_100 AC 902 ms
63,136 KB
testcase_101 AC 959 ms
63,972 KB
testcase_102 AC 952 ms
63,988 KB
testcase_103 AC 946 ms
63,896 KB
testcase_104 AC 954 ms
64,060 KB
testcase_105 AC 949 ms
63,868 KB
testcase_106 AC 952 ms
63,864 KB
testcase_107 AC 956 ms
63,924 KB
testcase_108 AC 960 ms
63,624 KB
testcase_109 AC 943 ms
64,084 KB
testcase_110 AC 950 ms
63,768 KB
testcase_111 AC 974 ms
63,828 KB
testcase_112 AC 962 ms
64,060 KB
testcase_113 AC 953 ms
63,904 KB
testcase_114 AC 960 ms
63,952 KB
testcase_115 AC 954 ms
63,800 KB
testcase_116 AC 949 ms
64,040 KB
testcase_117 AC 957 ms
63,756 KB
testcase_118 AC 948 ms
63,876 KB
testcase_119 AC 943 ms
63,524 KB
testcase_120 AC 947 ms
63,876 KB
testcase_121 AC 964 ms
63,936 KB
testcase_122 WA -
testcase_123 WA -
testcase_124 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

//import java.util.Scanner

import java.io._
import java.nio.file.Files._
import java.nio.file.Path
import java.util.StringTokenizer

import scala.collection.immutable._
import scala.io.Codec

/**
  * Scala implementation of a faster java.util.Scanner
  * See: http://codeforces.com/blog/entry/7018
  */

class Scanner(reader: LineNumberReader) extends Iterable[String] with AutoCloseable {
  def this(reader: BufferedReader) = this(new LineNumberReader(reader))

  def this(reader: Reader) = this(new BufferedReader(reader))

  def this(inputStream: InputStream)(implicit codec: Codec) = this(new InputStreamReader(inputStream, codec.charSet))

  def this(path: Path)(implicit codec: Codec) = this(newBufferedReader(path, codec.charSet))

  def this(file: File)(implicit codec: Codec) = this(file.toPath)(codec)

  def this(str: String) = this(new StringReader(str))

  override def iterator: Iterator[String] = for {
    line <- Iterator.continually(reader.readLine()).takeWhile(_ != null)
    tokenizer = new StringTokenizer(line)
    tokens <- Iterator.continually(tokenizer).takeWhile(_.hasMoreTokens)
  } yield tokens.nextToken()

  private[this] var current = iterator

  def hasNext: Boolean = current.hasNext

  @inline def next(): String = current.next()

  /**
    * This is different from Java's scanner.nextLine
    * The Java one is a misnomer since it actually travel to end of current line
    * This one actually does fetch the next line
    */
  def nextLine(): String = {
    val line = reader.readLine()
    current = iterator
    line
  }

  def lineNumber: Int = reader.getLineNumber

  def nextString(): String = next()

  def nextBoolean(): Boolean = next().toBoolean

  def nextByte(radix: Int = 10): Byte = java.lang.Byte.parseByte(next(), radix)

  def nextShort(radix: Int = 10): Short = java.lang.Short.parseShort(next(), radix)

  def nextInt(radix: Int = 10): Int = java.lang.Integer.parseInt(next(), radix)

  def nextLong(radix: Int = 10): Long = java.lang.Long.parseLong(next(), radix)

  def nextBigInt(radix: Int = 10): BigInt = BigInt(next(), radix)

  def nextFloat(): Float = next().toFloat

  def nextDouble(): Double = next().toDouble

  def nextBigDecimal(): BigDecimal = BigDecimal(next())

  override def close(): Unit = reader.close()
}


class IUnionFind(val size: Int) {

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

  private val nodes = Array.fill[Node](size)(Node(None, treeSize = 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) =>
      nodes(t).parent = Some(root(p))
      nodes(t).parent.get
  }
}


object Main {
  def solve(sc: => Scanner): Unit = {
    val A, B, C = sc.nextDouble()
    if (A == 0) {
      if (B == 0) {
        if (C == 0) println(-1)
        else println(0)
      } else {
        println(1)
        println("%.11f".format(-(C / B)))
      }
    } else {
      if (B * B - 4 * A * C < 0) println(0)
      else {
        if (Math.abs(B * B - 4 * A * C) < 1e-6) {
          println(1)
          println("%.11f".format(-B / (2 * A)))
        }
        else {
          println(2)
          println("%.11f".format((-B - sqt(B.toLong * B.toLong - 4 * A.toLong * C.toLong)) / (2 * A)))
          println("%.11f".format((-B + sqt(B.toLong * B.toLong - 4 * A.toLong * C.toLong)) / (2 * A)))
        }
      }
    }
  }

  def sqt(n: Long): Double = {
    val d = n
    var a: Double = 1.0
    var b: Double = d
    while (b - a >= 0) {
      val mid = (a + b) / 2
      if (mid * mid - d > 0) b = mid - 0.0000005 //adjust down
      else a = mid + 0.0000005 //adjust up
    }
    b
  }

  def recursive(N: Long): Long = {
    if (N == 0) 1 else recursive(N - 1) * 5 + 1
  }

  implicit class implicitInt(val N: Int) {
    def times[B](function: Int => B): IndexedSeq[B] = (0 until N).map(function)
  }

  def calc(N: Long): Long = {
    if (N == 0) 0 else if (N % 9 == 0) 9 else N % 9
  }

  def time(s: String): Int =
    s.substring(0, 2).toInt * 60 + s.substring(3, 5).toInt

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

  def getFibonacci(prevprev: Long = 0, prev: Long = 1): Stream[Long] =
    Stream.cons(prevprev, getFibonacci(prev, prevprev + prev))

  var memo: Map[(Long, Long), Long] = Map[(Long, Long), Long]()

  @scala.annotation.tailrec
  def recursive2(X: Set[Long], Y: Stream[Long]): Long = if (X.contains(Y.head)) X.size else recursive2(X + Y.head, Y.tail)

  def check(i: Int, X: String): Long = {
    if (X == "") 0 else check(i, X.tail) * i + X.head.toString.toLong
  }

  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
  }

  @scala.annotation.tailrec
  def gcd(i: Long, j: Long): Long = {
    if (i < j) gcd(j, i)
    else if (j == 0) i
    else gcd(j, i % j)
  }

  def primeFactors(i: Long): List[Long] = primeFactors_(i, 1).sorted


  def primeFactors_(i: Long, j: Long): List[Long] = {
    if (j * j > i) List.empty else if (i % j == 0) primeFactors_(i, j + 1) ++ List[Long](j, i / j) else primeFactors_(i, j + 1)
  }

  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]

  private val codeTable: List[(Int, String)] = 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 =>

      @scala.annotation.tailrec
      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).isEmpty
    }
    } =>

      @scala.annotation.tailrec
      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())
  }
}

object PowMod {
  def naivePowMod(a: Long, k: Long, m: Long): Long = {
    var t: Long = 1
    val aMod: Long = a % m

    for (_ <- 1L to k) {
      t = ((t % m) * aMod) % m
    }
    t.toInt
  }

  def powMod(a: Long, k: Long, m: Long): Long = {
    if (k == 0) 1
    else {
      val t = powMod(a, k / 2, m)
      if ((k % 2) == 0) (t * t) % m else (((t * t) % m) * a) % m
    }
  }
}
0