結果

問題 No.115 遠足のおやつ
ユーザー GoryudyumaGoryudyuma
提出日時 2018-11-03 19:09:44
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 817 ms / 5,000 ms
コード長 6,326 bytes
コンパイル時間 14,282 ms
コンパイル使用メモリ 279,092 KB
実行使用メモリ 63,888 KB
最終ジャッジ日時 2024-06-10 23:54:42
合計ジャッジ時間 50,684 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 763 ms
62,544 KB
testcase_01 AC 777 ms
62,512 KB
testcase_02 AC 806 ms
63,620 KB
testcase_03 AC 790 ms
62,696 KB
testcase_04 AC 815 ms
63,580 KB
testcase_05 AC 817 ms
63,652 KB
testcase_06 AC 772 ms
62,712 KB
testcase_07 AC 805 ms
63,608 KB
testcase_08 AC 772 ms
62,468 KB
testcase_09 AC 758 ms
62,676 KB
testcase_10 AC 767 ms
62,508 KB
testcase_11 AC 770 ms
62,692 KB
testcase_12 AC 774 ms
62,676 KB
testcase_13 AC 774 ms
62,464 KB
testcase_14 AC 809 ms
63,612 KB
testcase_15 AC 811 ms
63,536 KB
testcase_16 AC 799 ms
63,564 KB
testcase_17 AC 808 ms
63,700 KB
testcase_18 AC 759 ms
62,668 KB
testcase_19 AC 802 ms
63,756 KB
testcase_20 AC 795 ms
63,728 KB
testcase_21 AC 791 ms
63,600 KB
testcase_22 AC 802 ms
63,544 KB
testcase_23 AC 773 ms
62,640 KB
testcase_24 AC 807 ms
63,648 KB
testcase_25 AC 795 ms
63,756 KB
testcase_26 AC 800 ms
63,372 KB
testcase_27 AC 807 ms
63,484 KB
testcase_28 AC 790 ms
63,560 KB
testcase_29 AC 799 ms
63,588 KB
testcase_30 AC 788 ms
63,568 KB
testcase_31 AC 805 ms
63,544 KB
testcase_32 AC 796 ms
63,740 KB
testcase_33 AC 793 ms
63,888 KB
testcase_34 AC 806 ms
63,624 KB
testcase_35 AC 814 ms
63,788 KB
testcase_36 AC 802 ms
63,708 KB
testcase_37 AC 786 ms
63,620 KB
testcase_38 AC 799 ms
63,476 KB
testcase_39 AC 762 ms
62,792 KB
testcase_40 AC 764 ms
62,744 KB
testcase_41 AC 784 ms
62,696 KB
testcase_42 AC 789 ms
63,364 KB
権限があれば一括ダウンロードができます

ソースコード

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

import java.io._
import java.nio.file.{Files, Path}
import java.util.StringTokenizer

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(Files.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 = 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 = current.hasNext

  @inline def next() = 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() = 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)(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) => {
      nodes(t).parent = Some(root(p))
      nodes(t).parent.get
    }
  }
}

object Main {
  def solve(sc: => Scanner): Unit = {
    val N, D, K = sc.nextInt()
    println(if (N >= K && K * (K + 1) / 2 <= D && D <= K * (K + 1) / 2 + K * (N - K)) {
      val E = Array.fill(K)(0).zipWithIndex.map {
        case (_, a) => a + 1
      }
      if (N != K) {
        val A = D - K * (K + 1) / 2
        val B = A / (N - K)
        val C = A % (N - K)

        (0 until B).foreach { i =>
          E(K - i - 1) += N - K
        }
        if (K - B - 1 >= 0) {
          E(K - B - 1) += C
        }
      }
      E.mkString(" ")
    } else (-1))
  }

  def calc(N: Long, R: Long, M: Long): Double = {
    math.sqrt(R * R - (R * 2 * ((M * 1.0 / N) - 0.5)) * (R * 2 * ((M * 1.0 / N) - 0.5))) * 2
  }

  def recursive(X: Long, primeList: Stream[Long]): Long = {
    0
  }

  def check(A: Long): Boolean = {
    if (A < 0) (check(-A)) else if (A % 10 == 0) (check(A / 10)) else (A < 10)
  }

  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