結果

問題 No.714 回転寿司屋のシミュレート
ユーザー GoryudyumaGoryudyuma
提出日時 2018-07-16 19:27:33
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 1,395 ms / 2,000 ms
コード長 4,604 bytes
コンパイル時間 11,487 ms
コンパイル使用メモリ 264,272 KB
実行使用メモリ 69,064 KB
最終ジャッジ日時 2023-09-13 18:36:20
合計ジャッジ時間 54,678 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 965 ms
63,272 KB
testcase_01 AC 982 ms
63,608 KB
testcase_02 AC 1,011 ms
64,140 KB
testcase_03 AC 1,064 ms
63,924 KB
testcase_04 AC 1,135 ms
64,432 KB
testcase_05 AC 1,188 ms
64,452 KB
testcase_06 AC 1,188 ms
64,620 KB
testcase_07 AC 1,352 ms
64,924 KB
testcase_08 AC 1,395 ms
69,064 KB
testcase_09 AC 1,310 ms
68,692 KB
testcase_10 AC 1,308 ms
68,872 KB
testcase_11 AC 1,196 ms
64,524 KB
testcase_12 AC 1,193 ms
64,632 KB
testcase_13 AC 1,245 ms
64,656 KB
testcase_14 AC 1,209 ms
64,496 KB
testcase_15 AC 1,180 ms
64,156 KB
testcase_16 AC 1,187 ms
64,652 KB
testcase_17 AC 1,310 ms
69,048 KB
testcase_18 AC 1,207 ms
64,272 KB
testcase_19 AC 1,189 ms
64,280 KB
testcase_20 AC 1,203 ms
64,320 KB
testcase_21 AC 1,184 ms
64,308 KB
testcase_22 AC 1,158 ms
64,108 KB
testcase_23 AC 1,181 ms
64,752 KB
testcase_24 AC 1,170 ms
64,356 KB
testcase_25 AC 1,184 ms
64,184 KB
testcase_26 AC 1,146 ms
64,192 KB
testcase_27 AC 1,237 ms
64,328 KB
testcase_28 AC 1,145 ms
64,104 KB
testcase_29 AC 1,156 ms
64,552 KB
testcase_30 AC 962 ms
63,396 KB
testcase_31 AC 986 ms
63,396 KB
testcase_32 AC 989 ms
63,432 KB
testcase_33 AC 984 ms
63,392 KB
testcase_34 AC 966 ms
63,496 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

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
    }
  }
}

class Sushi() {

  private case class Order(val order: Array[String])

  private var orders = Array.empty[(Long, Order)];

  def come(n: Long, a: Array[String]): Unit = {
    orders = (orders.takeWhile(_ match { case (x: Long, _) => x < n }) :+ (n, Order(a))) ++ orders.dropWhile(_ match { case (x: Long, _) => x <= n })
  }

  def takeout(s: String): Long = {
    orders.filter(_ match { case (_, order) => order.order.contains(s) }).headOption match {
      case Some((id, order)) => {
        come(id, order.order.takeWhile(_ != s) ++ order.order.dropWhile(_ != s).tail)
        id
      }
      case None => -1
    }
  }

  def leave(id: Long) = {
    orders = orders.filter(_._1 != id)
  }
}

object Main {
  def solve(sc: => Scanner): Unit = {
    recursive(sc.nextLong, new Sushi, sc)
  }

  def recursive(N: Long, sushi: Sushi, sc: => Scanner): Unit = {
    if (N != 0) {
      sc.nextLong match {
        case 0 => sushi.come(sc.nextLong, Array.fill(sc.nextInt)(sc.next))
        case 1 => println(sushi.takeout(sc.next))
        case 2 => sushi.leave(sc.nextLong)
      }
      recursive(N - 1, sushi, sc)
    }
  }

  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