結果

問題 No.588 空白と回文
ユーザー GoryudyumaGoryudyuma
提出日時 2018-05-30 20:38:06
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 1,121 ms / 2,000 ms
コード長 4,232 bytes
コンパイル時間 14,255 ms
コンパイル使用メモリ 275,968 KB
実行使用メモリ 64,612 KB
最終ジャッジ日時 2024-06-30 08:23:04
合計ジャッジ時間 41,360 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 963 ms
63,788 KB
testcase_01 AC 964 ms
63,596 KB
testcase_02 AC 967 ms
63,688 KB
testcase_03 AC 1,121 ms
64,584 KB
testcase_04 AC 968 ms
63,892 KB
testcase_05 AC 955 ms
63,624 KB
testcase_06 AC 966 ms
63,980 KB
testcase_07 AC 956 ms
63,808 KB
testcase_08 AC 936 ms
63,756 KB
testcase_09 AC 955 ms
63,596 KB
testcase_10 AC 970 ms
63,604 KB
testcase_11 AC 1,118 ms
64,612 KB
testcase_12 AC 1,096 ms
64,556 KB
testcase_13 AC 951 ms
63,792 KB
testcase_14 AC 960 ms
63,792 KB
testcase_15 AC 950 ms
63,604 KB
testcase_16 AC 954 ms
63,636 KB
testcase_17 AC 1,091 ms
64,556 KB
testcase_18 AC 960 ms
63,816 KB
testcase_19 AC 964 ms
63,676 KB
testcase_20 AC 1,111 ms
64,436 KB
testcase_21 AC 1,100 ms
64,468 KB
testcase_22 AC 1,101 ms
64,472 KB
testcase_23 AC 1,115 ms
64,492 KB
testcase_24 AC 940 ms
63,552 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) => root(p)
  }
}

object Main {
  val m = (1 << 9) - 1

  def solve(sc: => Scanner): Unit = {
    val S = sc.next
    println(((0 until S.size).map(i => (1 to math.min(S.size - i - 1, i)).map(j => if (S(i + j) == S(i - j)) (1) else (0)).sum * 2 + 1) ++
      (1 until S.size).map(i => (1 to math.min(S.size - i, i)).map(j => if (S(i + j - 1) == S(i - j)) (1) else (0)).sum * 2)).max)
  }

  def calc(XY: Long, M: Long): Long = {
    if (XY / M % 2 == 1) (XY % M) else (M - XY % M - 1)
  }

  def recursive(X: Long, primeList: => Stream[Long]): Long = {
    val now = primeList.head
    if (X < now * now) (X) else {
      val a = recursive2(X, now)
      a._1 * recursive(a._2, primeList.tail)
    }
  }

  def recursive2(X: Long, prime: Long): (Long, Long) = {
    if (X % prime != 0) ((1, X)) else {
      if (X % (prime * prime) == 0) (recursive2(X / prime / prime, prime)) else ((prime, X / prime))
    }
  }

  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 calc(v: Long): Long = (v + 1) * v / 2

  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