結果

問題 No.850 企業コンテスト2位
ユーザー te-shte-sh
提出日時 2021-07-11 16:14:55
言語 Crystal
(1.11.2)
結果
AC  
実行時間 48 ms / 2,000 ms
コード長 5,494 bytes
コンパイル時間 19,733 ms
コンパイル使用メモリ 262,588 KB
実行使用メモリ 24,336 KB
平均クエリ数 200.11
最終ジャッジ日時 2023-09-24 12:06:42
合計ジャッジ時間 20,711 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
24,120 KB
testcase_01 AC 24 ms
23,940 KB
testcase_02 AC 24 ms
23,352 KB
testcase_03 AC 23 ms
23,940 KB
testcase_04 AC 23 ms
24,120 KB
testcase_05 AC 26 ms
24,204 KB
testcase_06 AC 24 ms
23,916 KB
testcase_07 AC 30 ms
23,916 KB
testcase_08 AC 33 ms
24,324 KB
testcase_09 AC 34 ms
23,904 KB
testcase_10 AC 40 ms
23,304 KB
testcase_11 AC 39 ms
23,304 KB
testcase_12 AC 40 ms
24,204 KB
testcase_13 AC 40 ms
23,304 KB
testcase_14 AC 39 ms
23,976 KB
testcase_15 AC 39 ms
23,460 KB
testcase_16 AC 38 ms
24,336 KB
testcase_17 AC 38 ms
23,940 KB
testcase_18 AC 40 ms
23,580 KB
testcase_19 AC 39 ms
23,328 KB
testcase_20 AC 39 ms
23,304 KB
testcase_21 AC 40 ms
23,976 KB
testcase_22 AC 40 ms
24,180 KB
testcase_23 AC 40 ms
23,280 KB
testcase_24 AC 38 ms
23,304 KB
testcase_25 AC 38 ms
24,240 KB
testcase_26 AC 38 ms
23,568 KB
testcase_27 AC 25 ms
23,916 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

def solve(io)
  n = io.get

  a = Array.new(n, &.+ 1)
  b = Array.new(n+1) { [] of Int32 }

  while a.size > 1
    a2 = [] of Int32
    a.each_slice(2) do |g|
      if g.size == 1
        a2 << g[0]
      else
        io.put_f "?", g[0], g[1]
        w = io.get
        if w == g[0]
          b[g[0]] << g[1]
        else
          b[g[1]] << g[0]
        end
        a2 << w
      end
    end
    a = a2
  end

  a = b[a[0]]
  while a.size > 1
    a2 = [] of Int32
    a.each_slice(2) do |g|
      if g.size == 1
        a2 << g[0]
      else
        io.put_f "?", g[0], g[1]
        a2 << io.get
      end
    end
    a = a2
  end

  io.put "!", a[0]
end

struct Int
  def cdiv(b : Int)
    (self + b - 1) // b
  end

  def bit?(i : Int)
    bit(i) == 1
  end

  def set_bit(i : Int)
    self | (self.class.new(1) << i)
  end

  def reset_bit(i : Int)
    self & ~(self.class.new(1) << i)
  end

  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.34.0") < 0 %}
    def bit_length : Int32
      x = self < 0 ? ~self : self

      if x.is_a?(Int::Primitive)
        Int32.new(sizeof(self) * 8 - x.leading_zeros_count)
      else
        to_s(2).size
      end
    end
  {% end %}
end

struct Int32
  SQRT_MAX = 46_340_i32

  def isqrt
    m = SQRT_MAX
    r = (1_i32..SQRT_MAX).bsearch { |i| i**2 > self }
    r.nil? ? SQRT_MAX : r - 1
  end
end

struct Int64
  SQRT_MAX = 3_037_000_499_i64

  def isqrt
    r = (1_i64..SQRT_MAX).bsearch { |i| i**2 > self }
    r.nil? ? SQRT_MAX : r - 1
  end
end

struct Number
  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.1.0") < 0 %}
    def zero?
      self == 0
    end

    def positive?
      self > 0
    end

    def negative?
      self < 0
    end
  {% end %}

  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.36.0") < 0 %}
    def self.additive_identity
      zero
    end

    def self.multiplicative_identity
      new(1)
    end
  {% end %}
end

class Array
  macro new_md(*args, &block)
    {% if !block %}
      {% for arg, i in args[0...-2] %}
        Array.new({{arg}}) {
      {% end %}
      Array.new({{args[-2]}}, {{args[-1]}})
      {% for arg in args[0...-2] %}
        }
      {% end %}
    {% else %}
      {% for arg, i in args %}
        Array.new({{arg}}) { |_i{{i}}|
      {% end %}
      {% for block_arg, i in block.args %}
        {{block_arg}} = _i{{i}}
      {% end %}
      {{block.body}}
      {% for arg in args %}
        }
      {% end %}
    {% end %}
  end
end

class ProconIO
  def initialize(@ins : IO = STDIN, @outs : IO = STDOUT)
    @buf = [] of String
    @index = 0
  end

  def get(k : T.class = Int32) forall T
    get_v(k)
  end

  macro define_get
    {% for i in (2..9) %}
      def get(
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        {
          {% for j in (1..i) %}
            get(k{{j}}){% if j < i %},{% end %}
          {% end %}
        }
      end
    {% end %}
  end
  define_get

  macro define_getn
    {% for i in (2..9) %}
      def get{{i}}(k : T.class = Int32) forall T
        get(
          {% for j in (1..i) %}
            k{% if j < i %}, {% end %}
          {% end %}
        )
      end
    {% end %}
  end
  define_getn

  def get_a(n : Int, k : T.class = Int32) forall T
    Array.new(n) { get_v(k) }
  end

  def get_c(n : Int, k : T.class = Int32) forall T
    get_a(n, k)
  end

  macro define_get_c
    {% for i in (2..9) %}
      def get_c(
            n : Int,
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        a = Array.new(n) do
          get(
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        end
        {
          {% for j in (1..i) %}
            a.map { |e| e[{{j-1}}] }{% if j < i %},{% end %}
          {% end %}
        }
      end
    {% end %}
  end
  define_get_c

  macro define_getn_c
    {% for i in (2..9) %}
      def get{{i}}_c(n : Int, k : T.class = Int32) forall T
        get_c(
          n,
          {% for j in (1..i) %}
            k{% if j < i %}, {% end %}
          {% end %}
        )
      end
    {% end %}
  end
  define_getn_c

  def get_m(r : Int, c : Int, k : T.class = Int32) forall T
    Array.new(r) { get_a(c, k) }
  end

  def put(*vs)
    vs.each.with_index do |v, i|
      put_v(v)
      @outs.print i < vs.size - 1 ? " " : "\n"
    end
  end

  def put_e(*vs)
    put(*vs)
    exit
  end

  def put_f(*vs)
    put(*vs)
    @outs.flush
  end


  private def get_v(k : Int32.class); get_token.to_i32; end
  private def get_v(k : Int64.class); get_token.to_i64; end
  private def get_v(k : UInt32.class); get_token.to_u32; end
  private def get_v(k : UInt64.class); get_token.to_u64; end
  private def get_v(k : Float64.class); get_token.to_f64; end
  private def get_v(k : String.class); get_token; end

  private def get_token
    if @buf.size == @index
      str = @ins.read_line
      @buf = str.split
      @index = 0
    end
    v = @buf[@index]
    @index += 1
    v
  end

  private def put_v(vs : Enumerable)
    vs.each_with_index do |v, i|
      @outs.print v
      @outs.print " " if i < vs.size - 1
    end
  end

  private def put_v(v)
    @outs.print v
  end
end

macro min_u(a, b)
  {{a}} = Math.min({{a}}, {{b}})
end

macro max_u(a, b)
  {{a}} = Math.max({{a}}, {{b}})
end

macro zip(a, *b, &block)
  {{a}}.zip({{*b}}) {{block}}
end

solve(ProconIO.new)
0