結果
問題 | No.693 square1001 and Permutation 2 |
ユーザー |
|
提出日時 | 2018-06-15 19:14:54 |
言語 | Scala(Beta) (3.6.2) |
結果 |
AC
|
実行時間 | 973 ms / 2,000 ms |
コード長 | 4,052 bytes |
コンパイル時間 | 15,587 ms |
コンパイル使用メモリ | 283,832 KB |
実行使用メモリ | 65,800 KB |
最終ジャッジ日時 | 2024-06-30 14:56:44 |
合計ジャッジ時間 | 27,530 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 9 |
ソースコード
import java.util.Scannerimport scala.collection.Searching._import scala.annotation.tailrecimport scala.collection.mutableimport scala.collection.immutable._import scala.io.StdIn.readLineclass 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) => root(p)}}object Main {def solve(sc: => Scanner): Unit = {println(Array.fill(sc.nextInt)(sc.nextInt - 1).sorted.zipWithIndex.map(x => math.abs(x._1 - x._2)).sum)}def calc(s: Seq[Long], N: Long): Boolean = {if (s.head > N) (false) else if (s.contains(N - s.head)) (true) else (calc(s.tail, N))}def recursive(N: Long, now: Long): Long = {if (N == 0) (0) else {val price = now * (now + 1) / 2if (N >= price) {println(price)recursive(N - price, now) + 1} else (recursive(N, now - 1))}}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 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())}}}