結果
問題 | No.998 Four Integers |
ユーザー | Goryudyuma |
提出日時 | 2020-02-29 23:18:14 |
言語 | Scala(Beta) (3.4.0) |
結果 |
AC
|
実行時間 | 951 ms / 1,000 ms |
コード長 | 8,698 bytes |
コンパイル時間 | 18,513 ms |
コンパイル使用メモリ | 273,748 KB |
実行使用メモリ | 65,436 KB |
最終ジャッジ日時 | 2024-11-30 23:17:18 |
合計ジャッジ時間 | 40,708 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 904 ms
63,376 KB |
testcase_01 | AC | 951 ms
63,600 KB |
testcase_02 | AC | 932 ms
63,796 KB |
testcase_03 | AC | 923 ms
63,352 KB |
testcase_04 | AC | 914 ms
63,496 KB |
testcase_05 | AC | 920 ms
63,412 KB |
testcase_06 | AC | 934 ms
63,596 KB |
testcase_07 | AC | 926 ms
63,536 KB |
testcase_08 | AC | 917 ms
63,596 KB |
testcase_09 | AC | 934 ms
63,400 KB |
testcase_10 | AC | 901 ms
65,436 KB |
testcase_11 | AC | 900 ms
63,576 KB |
testcase_12 | AC | 930 ms
63,552 KB |
testcase_13 | AC | 943 ms
63,444 KB |
testcase_14 | AC | 924 ms
63,688 KB |
testcase_15 | AC | 900 ms
63,668 KB |
testcase_16 | AC | 904 ms
63,604 KB |
testcase_17 | AC | 907 ms
63,664 KB |
testcase_18 | AC | 921 ms
63,440 KB |
testcase_19 | AC | 899 ms
63,740 KB |
testcase_20 | AC | 919 ms
63,564 KB |
testcase_21 | AC | 908 ms
65,304 KB |
testcase_22 | AC | 886 ms
65,348 KB |
testcase_23 | AC | 901 ms
63,640 KB |
testcase_24 | AC | 907 ms
63,548 KB |
ソースコード
//import java.util.Scannerimport java.io._import java.nio.file.Files._import java.nio.file.Pathimport java.util.StringTokenizerimport scala.collection.immutable._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(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: Iterator[String] = 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: Boolean = current.hasNext@inline def next(): String = 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(): Unit = 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)(Node(None, treeSize = 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 = {println(if (Array.fill(4)(sc.nextLong()).sorted.sliding(2).forall(x => x(0) + 1 == x(1))) "Yes" else "No")}def flip(A: Array[Boolean], B: Array[(Int, Long)]): Array[(Int, Long)] = {B.map { case (index, _) =>(index, (if (0 < index && A(index - 1)) B(index - 1)._2 else 0L) + (if (index + 1 < B.length && !A(index + 1)) B(index + 1)._2 else 0L))}}val mod: Long = (1e9 + 7).toLong@scala.annotation.tailrecdef recursive(A: Long, B: Long, ans: Long): Long = {if (A == 0) ans else recursive(A / B, B, ans + 1)}@scala.annotation.tailrecdef factorial(now: Long, ans: Long = 1): Long = {if (now == 0) 0 else if (now == 1) ans else factorial(now - 1, now * ans)}implicit class implicitInt(val N: Int) {def times[B](function: Int => B): IndexedSeq[B] = (0 until N).map(function)}def calc(input: (Long, Long, Long, Long, Long, Long)): Long = {input match {case (a, b, c, x, y, z) => {var ans: Long = Long.MaxValueif (b >= 3 && (a >= 2 || c >= 2)) {ans = Math.min(ans, Math.max(a - (b - 1), 0) * x + Math.max(c - Math.min(a - 1, b - 2), 0) * z)ans = Math.min(ans, Math.max(a - Math.min(c - 1, b - 2), 0) * x + Math.max(c - (b - 1), 0) * z)}// println(ans)if (b >= 2 && (a >= b && c >= b + 1)) {ans = Math.min(ans, y + Math.max(0, a - (c - 1)) * x)}// println(ans)if (b >= 2 && (a >= b + 1 && c >= b)) {ans = Math.min(ans, y + Math.max(0, c - (a - 1)) * z)}// println(ans)if (a >= 2 && c >= 2)if (a != c)ans = Math.min(ans, Math.max(0, b - (Math.min(a, c) - 1)) * y)else if (a >= 3 && c >= 3)ans = Math.min(ans, Math.max(0, b - (Math.min(a, c) - 2)) * y + Math.min(x, z))// println(ans)if (ans == Long.MaxValue) ans = -1ans}}}def time(s: String): Int =s.substring(0, 2).toInt * 60 + s.substring(3, 5).toIntdef getPermutation(begin: Long = 0): Stream[Long] =Stream.cons(begin, getPermutation(begin + 1))def getFibonacci(prevprev: Long = 0, prev: Long = 1): Stream[Long] =Stream.cons(prevprev, getFibonacci(prev, prevprev + prev))@scala.annotation.tailrecdef recursive2(X: Set[Long], Y: Stream[Long]): Long = if (X.contains(Y.head)) X.size else recursive2(X + Y.head, Y.tail)def check(i: Int, X: String): Long = {if (X == "") 0 else check(i, X.tail) * i + X.head.toString.toLong}def shift(n: Long): Long = {if (n == 0) 0else if (n == 1) 1else shift(n - 1) << 1}def unShift(n: Long): Long = {if (n == 0) 0else unShift(n >> 1) + 1}@scala.annotation.tailrecdef gcd(i: Long, j: Long): Long = {if (i < j) gcd(j, i)else if (j == 0) ielse gcd(j, i % j)}def primeFactors(i: Long): List[Long] = primeFactors_(i, 1).sorteddef primeFactors_(i: Long, j: Long): List[Long] = {if (j * j > i) List.empty else if (i % j == 0) primeFactors_(i, j + 1) ++ List[Long](j, i / j) else primeFactors_(i, j + 1)}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]private val codeTable: List[(Int, String)] = 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 =>@scala.annotation.tailrecdef 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).isEmpty}} =>@scala.annotation.tailrecdef 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())}}object PowMod {def naivePowMod(a: Long, k: Long, m: Long): Long = {var t: Long = 1val aMod: Long = a % mfor (_ <- 1L to k) {t = ((t % m) * aMod) % m}t.toInt}def powMod(a: Long, k: Long, m: Long): Long = {if (k == 0) 1else {val t = powMod(a, k / 2, m)if ((k % 2) == 0) (t * t) % m else (((t * t) % m) * a) % m}}}