結果

問題 No.934 Explosive energy drink
ユーザー yakamotoyakamoto
提出日時 2019-11-29 23:03:03
言語 Scala(Beta)
(3.4.0)
結果
WA  
実行時間 -
コード長 5,833 bytes
コンパイル時間 10,701 ms
コンパイル使用メモリ 278,756 KB
実行使用メモリ 82,356 KB
平均クエリ数 713.00
最終ジャッジ日時 2024-07-16 18:48:20
合計ジャッジ時間 41,144 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 798 ms
79,964 KB
testcase_01 AC 1,340 ms
79,984 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 815 ms
80,084 KB
testcase_06 AC 792 ms
78,428 KB
testcase_07 AC 819 ms
78,948 KB
testcase_08 AC 793 ms
78,288 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 880 ms
78,864 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
権限があれば一括ダウンロードができます

ソースコード

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[this] val oj = System.getenv("ATCODER_DEBUG") == null
  @inline private final def DEBUG(f: => Unit): Unit = {
    if (!oj){ f }
  }
  @inline private final def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) }
  @inline def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) }
  @inline private final def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) }
  @inline private final def debugDim(m: Array[Array[Int]]): Unit = if (!oj){
    REP(m.length) { i =>
      debug(m(i))
    }
  }
  @inline private final 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()
    }
  }
  @inline def debug(s: => String): Unit = DEBUG {
    System.err.println(s)
  }
  @inline private final def debugL(num: => Long): Unit = DEBUG {
    System.err.println(num)
  }
  private def isDebug[A](debug: => A, online: => A): A = {
    if (oj) online else debug
  }

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

    @inline private[this] final 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)(f)
  }
  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
  }
}

object Workspace {
  import Main._

  // 長さ2か3のレンジ
  case class Range(l: Int, r: Int) {
    def length = r - l
    def all = l until r
  }
}

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
  import Workspace._

  // toIntとか+7とかするならvalにしろ
  final private[this] val MOD = 1000000007

  def query(rgs: Seq[Range]): Boolean = {
    val nums = ArrayBuffer[Int]()
    rgs.foreach { rg =>
      nums ++= rg.all
    }

    out.println(s"? ${nums.length}")
    out.println(nums.sorted.mkString(" "))
    out.flush()
    ni() == 1
  }

  def searchWithHave(l: Int, r: Int, have: Range): Seq[Int] = {
    val res = ArrayBuffer[Int]()
    REP(r - l) { i =>
      val a = l + i
      if (query(Seq(have, Range(a, a + 1)))) res += a
    }
    res.toSeq
  }

  // (0, 1)
  def search(l: Int, r: Int): Seq[Int] = {
    if (r - l == 2) {
      Seq(l, l + 1)
    } else if (r - l == 3) {
      search3(l, l + 1, l + 2)
    } else {
      val res = ArrayBuffer[Int]()
      val med = (l + r) / 2
      val bl = query(Seq(Range(l, med)))
      val br = query(Seq(Range(med, r)))
      if (bl || br) {
        if (bl) res ++= search(l, med)
        if (br) res ++= search(med, r)
        val have = Range(res.head, res.head + 1)
        if (!bl) res ++= searchWithHave(l, med, have)
        if (!br) res ++= searchWithHave(med, r, have)

      } else {
        val left = Range(l, med)
        val right = Range(med, r)
        res ++= searchWithHave(l, med, right)
        res ++= searchWithHave(med, r, left)
      }
      res.toSeq
    }
  }

  def search3(a: Int, b: Int, c: Int): Seq[Int] = {
    val res = ArrayBuffer[Int]()
    val res1 = query(Seq(Range(a, a + 1), Range(b, b + 1)))
    val res2 = query(Seq(Range(b, b + 1), Range(c, c + 1)))
    val res3 = query(Seq(Range(a, a + 1), Range(c, c + 1)))
    if (res1) res ++= Seq(a, b)
    if (res2) res ++= Seq(b, c)
    if (res3) res ++= Seq(a, c)
    res.toSeq.distinct
  }

  def solve(): Unit = {
    val N = ni()
    val ans = search(1, N + 1)

    out.println(s"! ${ans.length}")
    out.println(ans.sorted.mkString(" "))
    out.flush()
  }
}
0