結果

問題 No.917 Make One With GCD
ユーザー yakamotoyakamoto
提出日時 2019-10-29 17:56:10
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 933 ms / 2,000 ms
コード長 4,059 bytes
コンパイル時間 14,091 ms
コンパイル使用メモリ 279,432 KB
実行使用メモリ 64,692 KB
最終ジャッジ日時 2024-06-24 11:12:18
合計ジャッジ時間 48,588 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 903 ms
64,540 KB
testcase_01 AC 882 ms
64,508 KB
testcase_02 AC 883 ms
64,500 KB
testcase_03 AC 899 ms
64,648 KB
testcase_04 AC 886 ms
64,496 KB
testcase_05 AC 894 ms
64,408 KB
testcase_06 AC 901 ms
64,548 KB
testcase_07 AC 890 ms
64,448 KB
testcase_08 AC 896 ms
64,532 KB
testcase_09 AC 924 ms
64,564 KB
testcase_10 AC 910 ms
64,384 KB
testcase_11 AC 920 ms
64,688 KB
testcase_12 AC 916 ms
64,392 KB
testcase_13 AC 916 ms
64,476 KB
testcase_14 AC 914 ms
64,632 KB
testcase_15 AC 927 ms
64,476 KB
testcase_16 AC 915 ms
64,484 KB
testcase_17 AC 925 ms
64,536 KB
testcase_18 AC 908 ms
64,508 KB
testcase_19 AC 894 ms
64,436 KB
testcase_20 AC 897 ms
64,600 KB
testcase_21 AC 904 ms
64,492 KB
testcase_22 AC 933 ms
64,576 KB
testcase_23 AC 906 ms
64,684 KB
testcase_24 AC 899 ms
64,520 KB
testcase_25 AC 908 ms
64,528 KB
testcase_26 AC 891 ms
64,668 KB
testcase_27 AC 893 ms
64,692 KB
testcase_28 AC 905 ms
64,576 KB
testcase_29 AC 896 ms
64,432 KB
testcase_30 AC 901 ms
64,460 KB
testcase_31 AC 895 ms
64,428 KB
testcase_32 AC 899 ms
64,472 KB
testcase_33 AC 889 ms
64,416 KB
testcase_34 AC 896 ms
64,408 KB
testcase_35 AC 895 ms
64,616 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

object Main {
  import java.io.{BufferedReader, InputStream, InputStreamReader}
  import java.util.StringTokenizer
  import scala.reflect.ClassTag

  def main(args: Array[String]): Unit = {
    val out = new java.io.PrintWriter(System.out)
    new Main(out, new InputReader(System.in)).solve()
    out.flush()
  }

  private val oj = System.getenv("ATCODER_DEBUG") == null
  def DEBUG(f: => Unit): Unit = {
    if (!oj){ f }
  }
  def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) }
  def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) }
  def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) }
  def debugDim(m: Array[Array[Long]]): Unit = if (!oj){
    REP(m.length) { i =>
      debug(m(i))
    }
  }
  def debugDimFlip(m: Array[Array[Long]]): Unit = if (!oj){
    REP(m(0).length) { j =>
      REP(m.length) { i =>
        System.err.print(m(i)(j))
        System.err.print(" ")
      }
      System.err.println()
    }
  }
  def debug(s: => String): Unit = DEBUG {
    System.err.println(s)
  }
  def debugL(num: => Long): Unit = DEBUG {
    System.err.println(num)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = Integer.parseInt(next())
    def nextLong(): Long = java.lang.Long.parseLong(next())
    def nextChar(): Char = next().charAt(0)

    def ni(): Int = nextInt()
    def nl(): Long = nextLong()
    def nc(): Char = nextChar()
    def ns(): String = next()
    def ns(n: Int): Array[Char] = ns().toCharArray
    def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
    def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
      val A1, A2 = Array.ofDim[Int](n)
      REP(n) { i =>
        A1(i) = ni() + offset
        A2(i) = ni() + offset
      }
      (A1, A2)
    }
    def nm(n: Int, m: Int): Array[Array[Int]] = {
      val A = Array.ofDim[Int](n, m)
      REP(n) { i =>
        REP(m) { j =>
          A(i)(j) = ni()
        }
      }
      A
    }
    def nal(n: Int): Array[Long] = map(n)(_ => nl())
    def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  }

  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }
  def TO(from: Int, to: Int)(f: Int => Unit): Unit = {
    REP(to - from + 1, from) { i =>
      f(i)
    }
  }
  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }

  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }
  def cumSum(as: Array[Int]): Array[Long] = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}

class Main(out: java.io.PrintWriter, sc: Main.InputReader) {
  import sc._
  import Main._
  import java.util.Arrays.sort

  import scala.collection.mutable
  import math.{abs, max, min}
  import mutable.ArrayBuffer

  // toIntとか+7とかするならvalにしろ
  @inline private def MOD = 1000000007

  def gcd(a: Int, b: Int): Int = {
    if (b == 0) a
    else gcd(b, a % b)
  }

  def solve(): Unit = {
    val n = ni()
    val a = na(n)
    var cur, next = mutable.Map[Int, Long]().withDefaultValue(0)
    REP(n) { i =>
      next.clear()
      next ++= cur
      next(a(i)) += 1
      for {
        (x, cnt) <- cur
      } {
        val nx = gcd(a(i), x)
        next(nx) += cnt
      }
      val t = cur
      cur = next
      next = t
    }
    out.println(cur(1))
  }
}
0