結果

問題 No.871 かえるのうた
ユーザー GoryudyumaGoryudyuma
提出日時 2019-08-30 23:05:54
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 1,385 ms / 2,000 ms
コード長 7,422 bytes
コンパイル時間 17,444 ms
コンパイル使用メモリ 269,944 KB
実行使用メモリ 72,016 KB
最終ジャッジ日時 2023-08-20 09:25:40
合計ジャッジ時間 75,346 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 957 ms
62,032 KB
testcase_01 AC 969 ms
62,056 KB
testcase_02 AC 971 ms
62,148 KB
testcase_03 AC 946 ms
62,120 KB
testcase_04 AC 958 ms
61,964 KB
testcase_05 AC 954 ms
62,052 KB
testcase_06 AC 964 ms
62,092 KB
testcase_07 AC 954 ms
62,132 KB
testcase_08 AC 1,043 ms
62,264 KB
testcase_09 AC 1,076 ms
62,240 KB
testcase_10 AC 970 ms
62,508 KB
testcase_11 AC 992 ms
62,404 KB
testcase_12 AC 1,227 ms
62,272 KB
testcase_13 AC 1,055 ms
62,276 KB
testcase_14 AC 1,381 ms
70,608 KB
testcase_15 AC 1,346 ms
70,996 KB
testcase_16 AC 1,385 ms
72,016 KB
testcase_17 AC 1,324 ms
67,620 KB
testcase_18 AC 1,173 ms
62,392 KB
testcase_19 AC 1,340 ms
70,804 KB
testcase_20 AC 1,202 ms
63,836 KB
testcase_21 AC 1,247 ms
64,472 KB
testcase_22 AC 952 ms
62,296 KB
testcase_23 AC 955 ms
62,148 KB
testcase_24 AC 948 ms
62,348 KB
testcase_25 AC 982 ms
62,268 KB
testcase_26 AC 1,157 ms
63,908 KB
testcase_27 AC 1,205 ms
62,364 KB
testcase_28 AC 950 ms
62,012 KB
testcase_29 AC 1,260 ms
62,372 KB
testcase_30 AC 1,290 ms
64,616 KB
testcase_31 AC 1,029 ms
62,180 KB
testcase_32 AC 1,277 ms
65,008 KB
testcase_33 AC 1,296 ms
68,264 KB
testcase_34 AC 1,219 ms
62,304 KB
testcase_35 AC 1,255 ms
66,224 KB
testcase_36 AC 1,268 ms
66,732 KB
testcase_37 AC 1,258 ms
64,628 KB
testcase_38 AC 1,323 ms
68,328 KB
testcase_39 AC 1,319 ms
67,936 KB
testcase_40 AC 1,296 ms
63,720 KB
testcase_41 AC 959 ms
62,436 KB
testcase_42 AC 1,296 ms
63,768 KB
testcase_43 AC 951 ms
62,084 KB
testcase_44 AC 947 ms
62,220 KB
testcase_45 AC 972 ms
61,992 KB
testcase_46 AC 962 ms
62,112 KB
testcase_47 AC 954 ms
62,080 KB
testcase_48 AC 951 ms
62,068 KB
権限があれば一括ダウンロードができます

ソースコード

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 {
  var X, A: Array[Long] = _

  def solve(sc: => Scanner): Unit = {
    val N, K = sc.nextInt()
    X = Array.fill(N)(sc.nextLong())
    A = Array.fill(N)(sc.nextLong())
    println(recursive(X(K - 1) - A(K - 1), K - 1, 0, X(K - 1) + A(K - 1), K - 1, N))
  }

  def recursive(minV: Long, minIndex: Int, minminIndex: Int, maxV: Long, maxIndex: Int, maxmaxIndex: Int): Int = {
    if (minIndex > minminIndex && minV <= X(minIndex - 1) && X(minIndex - 1) <= maxV)
      recursive(Math.min(minV, X(minIndex - 1) - A(minIndex - 1)), minIndex - 1, minminIndex, Math.max(maxV, X(minIndex - 1) + A(minIndex - 1)), maxIndex, maxmaxIndex)
    else if (maxIndex + 1 < maxmaxIndex && minV <= X(maxIndex + 1) && X(maxIndex + 1) <= maxV)
      recursive(Math.min(minV, X(maxIndex + 1) - A(maxIndex + 1)), minIndex, minminIndex, Math.max(maxV, X(maxIndex + 1) + A(maxIndex + 1)), maxIndex + 1, maxmaxIndex)
    else maxIndex - minIndex + 1
  }

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

  def calc(A: Array[Long]): Array[String] = {
    if (A.length == 0) Array.fill(0)("")
    else {
      val last = A.zipWithIndex.map(x => (x._1 - x._2, x._1)).takeWhile(x => x._1 == A.head).last._2
      if (last == A.head) "%d".format(A.head) +: calc(A.zipWithIndex.map(x => (x._1 - x._2, x._1)).dropWhile(x => x._1 == A.head).map(x => x._2))
      else "%d-%d".format(A.head, last) +: calc(A.zipWithIndex.map(x => (x._1 - x._2, x._1)).dropWhile(x => x._1 == A.head).map(x => x._2))
    }
  }

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


  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
  }

  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]

  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).isEmpty
    }
    } =>

      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