結果

問題 No.697 池の数はいくつか
ユーザー GoryudyumaGoryudyuma
提出日時 2018-06-09 19:46:51
言語 Scala(Beta)
(3.4.0)
結果
RE  
実行時間 -
コード長 4,456 bytes
コンパイル時間 13,508 ms
コンパイル使用メモリ 284,812 KB
実行使用メモリ 253,928 KB
最終ジャッジ日時 2024-11-25 12:52:49
合計ジャッジ時間 73,408 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 965 ms
65,768 KB
testcase_01 AC 970 ms
65,712 KB
testcase_02 AC 966 ms
66,140 KB
testcase_03 AC 969 ms
66,040 KB
testcase_04 AC 963 ms
65,892 KB
testcase_05 AC 962 ms
65,956 KB
testcase_06 AC 955 ms
65,648 KB
testcase_07 AC 965 ms
65,732 KB
testcase_08 AC 1,018 ms
65,624 KB
testcase_09 AC 980 ms
65,920 KB
testcase_10 AC 984 ms
65,724 KB
testcase_11 AC 965 ms
65,772 KB
testcase_12 AC 973 ms
65,944 KB
testcase_13 AC 990 ms
65,680 KB
testcase_14 AC 957 ms
65,640 KB
testcase_15 AC 967 ms
65,932 KB
testcase_16 AC 963 ms
65,460 KB
testcase_17 AC 987 ms
65,804 KB
testcase_18 AC 998 ms
66,000 KB
testcase_19 AC 993 ms
65,860 KB
testcase_20 AC 947 ms
66,028 KB
testcase_21 AC 937 ms
65,752 KB
testcase_22 AC 954 ms
65,588 KB
testcase_23 AC 1,002 ms
65,780 KB
testcase_24 AC 2,683 ms
155,640 KB
testcase_25 AC 2,713 ms
141,540 KB
testcase_26 AC 2,773 ms
141,128 KB
testcase_27 AC 2,742 ms
141,432 KB
testcase_28 AC 2,722 ms
140,812 KB
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
権限があれば一括ダウンロードができます

ソースコード

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 H, W = sc.nextInt
    var ui = new IUnionFind(H * W)
    val A = Array.fill[Array[Boolean]](H)(Array.fill[Boolean](W)(sc.nextInt == 1))
    for (i <- 0 until H) {
      for (j <- 0 until W) {
        if (i != H - 1) {
          if (A(i)(j) == A(i + 1)(j)) {
            ui = ui.union(i * W + j, (i + 1) * W + j)
          }
        }
        if (j != W - 1) {
          if (A(i)(j) == A(i)(j + 1)) {
            ui = ui.union(i * W + j, i * W + (j + 1))
          }
        }
      }
    }
    println((0 until H).map(i => (0 until W).map(j => if (A(i)(j) == true && ui.root(i * W + j) == i * W + j) (1) else (0)).sum).sum)
  }

  def recursive(N: Long, A: Array[Int], now: Long, sc: => Scanner): Long = {
    if (N == 0) (0) else (
      A.head * now + recursive(N - 1, A.tail, now - sc.nextInt + sc.nextInt, sc)
      )
  }

  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