結果

問題 No.401 数字の渦巻き
ユーザー GoryudyumaGoryudyuma
提出日時 2018-06-28 16:51:29
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 1,291 ms / 2,000 ms
コード長 3,992 bytes
コンパイル時間 13,920 ms
コンパイル使用メモリ 280,640 KB
実行使用メモリ 92,404 KB
最終ジャッジ日時 2024-06-30 23:31:21
合計ジャッジ時間 46,920 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 979 ms
65,784 KB
testcase_01 AC 974 ms
65,840 KB
testcase_02 AC 983 ms
65,904 KB
testcase_03 AC 970 ms
65,644 KB
testcase_04 AC 973 ms
65,784 KB
testcase_05 AC 974 ms
65,656 KB
testcase_06 AC 977 ms
65,752 KB
testcase_07 AC 984 ms
65,604 KB
testcase_08 AC 990 ms
65,672 KB
testcase_09 AC 977 ms
65,780 KB
testcase_10 AC 990 ms
65,556 KB
testcase_11 AC 986 ms
65,900 KB
testcase_12 AC 986 ms
65,920 KB
testcase_13 AC 989 ms
65,892 KB
testcase_14 AC 1,001 ms
65,920 KB
testcase_15 AC 1,009 ms
66,204 KB
testcase_16 AC 1,014 ms
66,148 KB
testcase_17 AC 1,012 ms
66,284 KB
testcase_18 AC 1,014 ms
66,244 KB
testcase_19 AC 1,030 ms
66,216 KB
testcase_20 AC 1,041 ms
66,060 KB
testcase_21 AC 1,035 ms
66,216 KB
testcase_22 AC 1,026 ms
66,280 KB
testcase_23 AC 1,020 ms
66,284 KB
testcase_24 AC 1,030 ms
66,188 KB
testcase_25 AC 1,034 ms
66,024 KB
testcase_26 AC 1,027 ms
66,392 KB
testcase_27 AC 1,031 ms
66,368 KB
testcase_28 AC 1,291 ms
92,292 KB
testcase_29 AC 1,285 ms
92,404 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 {
  def solve(sc: => Scanner): Unit = {
    val N = sc.nextInt
    println((0 until N).map(i => (0 until N).map(j => show(i, j, N)).mkString(" ")).mkString("\n"))
  }

  def show(i: Int, j: Int, N: Int): String = {
    return (recursive(i, j, N) + 1).formatted("%03d")
  }

  def recursive(i: Int, j: Int, N: Int): Int = {
    if (i == 0) {
      j
    } else if (i == N - 1) {
      (N - 1) * 3 - j
    } else if (j == 0) {
      (N - 1) * 4 - i
    } else if (j == N - 1) {
      N + i - 1
    } else {
      recursive(i - 1, j - 1, N - 2) + (N - 1) * 4
    }
  }

  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