結果

問題 No.524 コインゲーム
ユーザー yakamotoyakamoto
提出日時 2018-12-25 04:03:20
言語 Scala(Beta)
(3.4.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,317 bytes
コンパイル時間 9,602 ms
コンパイル使用メモリ 265,540 KB
実行使用メモリ 63,620 KB
最終ジャッジ日時 2023-09-13 21:56:33
合計ジャッジ時間 46,516 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 AC 992 ms
62,548 KB
testcase_02 AC 959 ms
62,412 KB
testcase_03 AC 986 ms
62,604 KB
testcase_04 AC 978 ms
62,456 KB
testcase_05 TLE -
testcase_06 AC 942 ms
62,472 KB
testcase_07 AC 950 ms
62,756 KB
testcase_08 AC 954 ms
62,788 KB
testcase_09 AC 981 ms
62,752 KB
testcase_10 AC 969 ms
62,360 KB
testcase_11 AC 961 ms
62,424 KB
testcase_12 AC 960 ms
62,740 KB
testcase_13 AC 950 ms
62,476 KB
testcase_14 AC 952 ms
62,476 KB
testcase_15 AC 965 ms
62,608 KB
testcase_16 AC 960 ms
62,484 KB
testcase_17 AC 938 ms
62,948 KB
testcase_18 AC 939 ms
62,540 KB
testcase_19 AC 961 ms
62,564 KB
testcase_20 AC 988 ms
62,840 KB
testcase_21 AC 933 ms
62,552 KB
testcase_22 AC 954 ms
62,700 KB
testcase_23 AC 988 ms
62,840 KB
testcase_24 AC 979 ms
62,544 KB
testcase_25 AC 978 ms
62,920 KB
testcase_26 TLE -
testcase_27 AC 997 ms
63,620 KB
testcase_28 AC 987 ms
62,468 KB
testcase_29 AC 988 ms
62,784 KB
testcase_30 AC 966 ms
62,496 KB
testcase_31 AC 987 ms
62,528 KB
testcase_32 AC 989 ms
62,512 KB
testcase_33 AC 955 ms
62,656 KB
testcase_34 AC 944 ms
62,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer

  import scala.collection.mutable
  import scala.util.Sorting
  import math.{abs, max, min}
  import mutable.{ArrayBuffer, ListBuffer}
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val N = nl()

//    val MAX = 3
    val MAX = 32

    implicit def toInt(b: Boolean): Int = if (b) 1 else 0
    val memo = Array.fill[Long](MAX, MAX, 2, 2)(-1)

    def calc(k: Int, i: Int, less: Boolean, found: Boolean): Long = {
      if (i == MAX) toInt(found)
      else {
        if (memo(k)(i)(less)(found) == -1) {
          var res = 0L
          val b = ((N >> (MAX - 1 - i)) & 1).toInt
          val limit = if (less) 1 else b.toInt

          REP(limit + 1) { d =>
            res += calc(k, i + 1, less || (d < b), found || (i == k && d == 1))
          }

          memo(k)(i)(less)(found) = res
        }
        memo(k)(i)(less)(found)
      }
    }

    val ok = map(MAX) { k =>
      calc(k, 0, false, false)
    }.exists(_ % 2 != 0)

//    REP(MAX) { k =>
//      System.err.println(s"$k ${calc(k, 0, false, false)}")
//    }

    if (ok) out.println("O")
    else out.println("X")
  }

  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 = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.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 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]) = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}
0