Submission #415693


Source Code Expand

import java.util.Scanner

object Main {
  val d: List[Int] = List(2, 3, 5, 7, 11, 13)
  val e: List[Int] = List(4, 6, 8, 9, 10, 12)
  val sc = new Scanner(System.in)
  
  def main(args: Array[String]): Unit = {
    val n = sc.nextInt()
    val t = sc.nextInt()
    println(solve(n, t, 0))
  }
  
  def solve(n: Int, t: Int, close_time: Int): Int = {
    if(n == 0){
      0
    }else{
      val a = sc.nextInt()
      Math.min(t, a + t - close_time) + solve(n-1, t, a + t)
    }
  }
  
  
  /**
   * P16
   */
  def drop[T](n: Int, list: List[T]): List[T] = {
    def f(i: Int)(n: Int, list: List[T]): List[T] = (i, n, list) match {
      case (_, _, Nil) => Nil
      case (1, n, car :: cdr) => f(n)(n, cdr)
      case (i, n, car :: cdr) => car :: f(i-1)(n, cdr)
    }
    f(n)(n, list)
  }
  /*
  def d[T](i: Int, n: Int, list: List[T]): List[T] = (i, n, list) match {
    case (_, _, Nil) => Nil
    case (1, n, car :: cdr) => d(n, n, cdr)
    case (i, n, car :: cdr) => car :: d(i-1, n, cdr)
  }
  */
  
  /**
   * P12
   */
  /*
  def decode[T](list: List[List[T]]): List[T] = list match {
    case Nil => Nil
    case List(n, v) :: cdr => 
      for(i <- 1 to n) yield {v} :: cdr
  }
  */
  
  /**
   * P11
   */
  def encode[T](list: List[T]): List[(Int, T)] = list match {
    case Nil => Nil
    case car :: cdr => {
      val (first, second) = list.span(x => x == car)
      (first.length, car) :: encode(second)
    }
  }
  
  /**
   * P10
   */
  def encodeModified[T](list: List[T]): List[Any] = list match {
    case Nil => Nil
    case first :: second :: cdr if first != second =>
      first :: encodeModified(second :: cdr)
    case car :: cdr => {
      val (first, second) = list.span(x => x == car)
      (first.length, car) :: encodeModified(second)
    }
  }
  
  /**
   * P09
   */
  def pack[T](list: List[T]): List[List[T]] = list match {
    case Nil => Nil
    case car :: cdr => {
      val (first, second) = list.span(x => x == car)
      first :: pack(second)
    }
  }
  
  /**
   * P08
   */
  def compress[T](list: List[T]): List[T] = list match {
    case first :: second :: cdr if first == second => compress(first :: cdr)
    case car :: cdr => car :: compress(cdr)
    case Nil => Nil
  }
  
  /**
   * P07
   */
  def flatten(list: List[Any]): List[Any] = list.flatMap {
      case l: List[_] => flatten(l)
      case elm => List(elm)
  }
  
  /**
   * P06
   */
  def isParindrome[T](list: List[T]): Boolean = list == list.reverse
  
  /**
   * P05
   */
  def reverse[T](list: List[T]): List[T] =
    list.foldLeft(List.empty[T])((x, y) => y :: x)
  
  /**
   * P04
   */
  def length[T](list: List[T]): Int = list match {
    case Nil => 0;
    case car :: cdr => 1 + length(cdr)
  }
  
  /**
   * P03
   */
  def nth[T](n: Int, list: List[T]): T = (n, list) match {
    case (0, car :: cdr) => car
    case (m, car :: cdr) => nth(m-1, cdr)
    case _ => throw new Exception
  }
  
  /**
   * P02
   */
  def penultimate[T](list: List[T]): T = list match {
    case first :: second :: Nil => first
    case car :: cdr => last(cdr)
    case _ => throw new Exception
  }
  
  /**
   * P01
   */
  def last[T](list: List[T]): T = list match {
    case car :: Nil => car
    case car :: cdr => last(cdr)
    case _ => throw new Exception
  }
}

Submission Info

Submission Time
Task B - 自動ドア
User yoshikyoto
Language Scala (2.11.5)
Score 0
Code Size 3430 Byte
Status RE
Exec Time 1756 ms
Memory 58964 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 50 0 / 50
Status
AC × 2
AC × 3
RE × 28
AC × 1
RE × 57
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, sample_01.txt, sample_02.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1125 ms 47876 KB
sample_02.txt AC 1121 ms 47932 KB
sample_23.txt AC 1113 ms 47636 KB
subtask1_01.txt RE 1482 ms 57556 KB
subtask1_02.txt RE 1425 ms 58744 KB
subtask1_03.txt RE 1406 ms 57888 KB
subtask1_04.txt RE 1408 ms 58636 KB
subtask1_05.txt RE 1430 ms 57808 KB
subtask1_06.txt RE 1406 ms 57824 KB
subtask1_07.txt RE 1415 ms 58964 KB
subtask1_08.txt RE 1405 ms 58804 KB
subtask1_09.txt RE 1401 ms 57832 KB
subtask1_10.txt AC 1326 ms 54756 KB
subtask1_11.txt RE 1509 ms 58156 KB
subtask1_12.txt RE 1568 ms 58392 KB
subtask1_13.txt RE 1501 ms 57512 KB
subtask1_14.txt RE 1595 ms 57928 KB
subtask1_15.txt RE 1756 ms 57604 KB
subtask1_16.txt RE 1427 ms 58876 KB
subtask1_17.txt RE 1394 ms 57328 KB
subtask1_18.txt RE 1413 ms 58056 KB
subtask1_19.txt RE 1417 ms 57344 KB
subtask1_20.txt RE 1417 ms 58192 KB
subtask1_21.txt RE 1567 ms 58060 KB
subtask1_22.txt RE 1418 ms 58496 KB
subtask1_23.txt RE 1390 ms 57832 KB
subtask1_24.txt RE 1409 ms 57700 KB
subtask1_25.txt RE 1400 ms 57580 KB
subtask1_26.txt RE 1402 ms 57860 KB
subtask1_27.txt RE 1417 ms 57684 KB
subtask1_28.txt RE 1393 ms 58036 KB
subtask1_29.txt RE 1399 ms 58588 KB
subtask2_01.txt RE 1374 ms 57576 KB
subtask2_02.txt RE 1391 ms 57660 KB
subtask2_03.txt RE 1413 ms 58944 KB
subtask2_04.txt RE 1402 ms 57896 KB
subtask2_05.txt RE 1408 ms 57788 KB
subtask2_06.txt RE 1413 ms 57660 KB
subtask2_07.txt RE 1417 ms 58108 KB
subtask2_08.txt RE 1416 ms 57692 KB
subtask2_09.txt RE 1411 ms 57912 KB
subtask2_10.txt RE 1405 ms 57560 KB
subtask2_11.txt RE 1409 ms 57768 KB
subtask2_12.txt RE 1494 ms 58960 KB
subtask2_13.txt RE 1421 ms 57684 KB
subtask2_14.txt RE 1407 ms 57876 KB
subtask2_15.txt RE 1409 ms 57796 KB
subtask2_16.txt RE 1417 ms 57968 KB
subtask2_17.txt RE 1412 ms 58312 KB
subtask2_18.txt RE 1434 ms 57964 KB
subtask2_19.txt RE 1401 ms 57900 KB
subtask2_20.txt RE 1414 ms 58236 KB
subtask2_21.txt RE 1398 ms 57484 KB
subtask2_22.txt RE 1425 ms 57484 KB
subtask2_23.txt RE 1427 ms 58192 KB
subtask2_24.txt RE 1425 ms 57656 KB
subtask2_25.txt RE 1414 ms 58724 KB
subtask2_26.txt RE 1414 ms 57972 KB
subtask2_27.txt RE 1415 ms 57560 KB
subtask2_28.txt RE 1411 ms 57936 KB
subtask2_29.txt RE 1407 ms 57856 KB