結果
問題 | No.739 大事なことなので2度言います |
ユーザー |
|
提出日時 | 2018-10-06 17:46:56 |
言語 | Scala(Beta) (3.6.2) |
結果 |
AC
|
実行時間 | 930 ms / 2,000 ms |
コード長 | 5,951 bytes |
コンパイル時間 | 12,916 ms |
コンパイル使用メモリ | 282,600 KB |
実行使用メモリ | 64,420 KB |
最終ジャッジ日時 | 2024-07-01 04:49:02 |
合計ジャッジ時間 | 24,908 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 7 |
ソースコード
//import java.util.Scannerimport scala.collection.Searching._import scala.annotation.tailrecimport scala.collection.mutableimport scala.collection.immutable._import scala.io.StdIn.readLineimport java.io._import java.nio.file.{Files, Path}import java.util.StringTokenizerimport 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 = iteratordef 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 = iteratorline}def lineNumber: Int = reader.getLineNumberdef nextString(): String = next()def nextBoolean(): Boolean = next().toBooleandef 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().toFloatdef nextDouble(): Double = next().toDoubledef 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 thisval root1 = root(t1)val root2 = root(t2)if (root1 == root2) return thisval 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 => tcase Some(p) => {nodes(t).parent = Some(root(p))nodes(t).parent.get}}}object Main {def solve(sc: => Scanner): Unit = {val S = sc.next()println(if (S.size % 2 == 0 && S.take(S.size / 2) == S.reverse.take(S.size / 2).reverse) ("YES") else ("NO"))}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.headleft - unitVal match {case n if (n == 0) => cont + unitCharcase 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.headleft.splitAt(unitChar.length) match {case ("", _) => contcase (`unitChar`, tail) => convert(tail, cont + unitVal, code)case _ => convert(left, cont, code.tail)}}convert(src.toUpperCase())}}}