結果

問題 No.871 かえるのうた
ユーザー te-shte-sh
提出日時 2021-07-30 12:18:14
言語 Crystal
(1.11.2)
結果
AC  
実行時間 89 ms / 2,000 ms
コード長 6,272 bytes
コンパイル時間 23,278 ms
コンパイル使用メモリ 261,388 KB
実行使用メモリ 25,076 KB
最終ジャッジ日時 2023-08-20 09:40:54
合計ジャッジ時間 26,767 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
4,356 KB
testcase_01 AC 2 ms
4,408 KB
testcase_02 AC 3 ms
4,416 KB
testcase_03 AC 3 ms
4,380 KB
testcase_04 AC 2 ms
4,440 KB
testcase_05 AC 3 ms
4,516 KB
testcase_06 AC 2 ms
4,368 KB
testcase_07 AC 3 ms
4,428 KB
testcase_08 AC 4 ms
4,932 KB
testcase_09 AC 5 ms
4,952 KB
testcase_10 AC 3 ms
4,520 KB
testcase_11 AC 3 ms
4,808 KB
testcase_12 AC 16 ms
7,684 KB
testcase_13 AC 6 ms
5,196 KB
testcase_14 AC 80 ms
23,788 KB
testcase_15 AC 80 ms
25,076 KB
testcase_16 AC 89 ms
23,972 KB
testcase_17 AC 74 ms
24,232 KB
testcase_18 AC 17 ms
7,888 KB
testcase_19 AC 80 ms
24,032 KB
testcase_20 AC 8 ms
6,084 KB
testcase_21 AC 30 ms
11,652 KB
testcase_22 AC 3 ms
4,416 KB
testcase_23 AC 3 ms
4,352 KB
testcase_24 AC 2 ms
4,352 KB
testcase_25 AC 4 ms
4,864 KB
testcase_26 AC 9 ms
6,232 KB
testcase_27 AC 14 ms
6,972 KB
testcase_28 AC 3 ms
4,380 KB
testcase_29 AC 46 ms
15,652 KB
testcase_30 AC 61 ms
19,872 KB
testcase_31 AC 5 ms
4,908 KB
testcase_32 AC 54 ms
17,216 KB
testcase_33 AC 80 ms
24,784 KB
testcase_34 AC 24 ms
9,052 KB
testcase_35 AC 49 ms
16,864 KB
testcase_36 AC 65 ms
19,920 KB
testcase_37 AC 37 ms
12,220 KB
testcase_38 AC 81 ms
22,648 KB
testcase_39 AC 74 ms
23,024 KB
testcase_40 AC 50 ms
16,604 KB
testcase_41 AC 3 ms
4,504 KB
testcase_42 AC 49 ms
16,612 KB
testcase_43 AC 3 ms
4,384 KB
testcase_44 AC 2 ms
4,384 KB
testcase_45 AC 3 ms
4,776 KB
testcase_46 AC 3 ms
4,384 KB
testcase_47 AC 3 ms
4,384 KB
testcase_48 AC 3 ms
4,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def solve(io)
  n, k = io.get2; k -= 1
  x = io.get_a(n, Int64)
  a = io.get_a(n, Int64)

  l = Array.new(n) do |i|
    x.bsearch_index { |xj| xj >= x[i] - a[i] } || n
  end
  r = Array.new(n) do |i|
    (x.bsearch_index { |xj| xj > x[i] + a[i] } || n) - 1
  end

  sl = SparseTable.new(l) { |a, b| {a, b}.min }
  sr = SparseTable.new(r) { |a, b| {a, b}.max }

  i = j = k
  loop do
    i2, j2 = sl[i..j], sr[i..j]
    break if i == i2 && j == j2
    i, j = i2, j2
  end

  io.put j - i + 1
end

class ProconIO
  def initialize(@ins : IO = STDIN, @outs : IO = STDOUT)
    @buf = IO::Memory.new("")
  end

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

  macro define_get
    {% for i in (2..9) %}
      def get({{ *(1..i).map { |j| "k#{j}".id } }})
        { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
      end
    {% end %}
  end
  define_get

  macro define_getn
    {% for i in (2..9) %}
      def get{{i}}(k : T.class = Int32) forall T
        get({{ *(1..i).map { "k".id } }})
      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, {{ *(1..i).map { |j| "k#{j}".id } }})
        a = Array.new(n) { get({{ *(1..i).map { |j| "k#{j}".id } }}) }
        { {{ *(1..i).map { |j| "a.map { |e| e[#{j-1}] }".id } }} }
      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, {{ *(1..i).map { "k".id } }})
      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

  macro define_put
    {% for i in (1..9) %}
      def put({{ *(1..i).map { |j| "v#{j}".id } }}, *, delimiter = " ")
        {% for j in (1..i) %}
          print_v(v{{j}}, delimiter)
          {% if j < i %}@outs << delimiter{% end %}
        {% end %}
        @outs.puts
      end
    {% end %}
  end
  define_put

  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
    loop do
      token = @buf.gets(' ', chomp: true)
      break token unless token.nil?
      @buf = IO::Memory.new(@ins.read_line)
    end
  end

  private def print_v(v, dlimiter)
    @outs << v
  end

  private def print_v(v : Enumerable, delimiter)
    v.each_with_index do |e, i|
      @outs << e
      @outs << delimiter if i < v.size - 1
    end
  end
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 Float64
  def near_zero?
    self.abs < EPSILON
  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

module Math
  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.2.0") < 0 %}
    def isqrt(value : Int::Primitive)
      raise ArgumentError.new "Input must be non-negative integer" if value < 0
      return value if value < 2
      res = value.class.zero
      bit = res.succ << (res.leading_zeros_count - 2)
      bit >>= value.leading_zeros_count & ~0x3
      while (bit != 0)
        if value >= res + bit
          value -= res + bit
          res = (res >> 1) + bit
        else
          res >>= 1
        end
        bit >>= 2
      end
      res
    end
  {% 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

class SparseTable(T)
  def initialize(@a : Array(T), &@compose : (T, T) -> T)
    @n = @a.size

    @log_table = Array.new(@n+1, 0)
    (2..@n).each do |i|
      @log_table[i] = @log_table[i >> 1] + 1
    end

    @rmq = Array.new_md(@log_table[@n] + 1, @n, 0)
    @n.times do |i|
      @rmq[0][i] = i
    end

    k = 1
    while (1 << k) < @n
      i = 0
      while i + (1 << k) <= @n
        x = @rmq[k-1][i]
        y = @rmq[k-1][i + (1 << k-1)]
        @rmq[k][i] = @compose.call(@a[x], @a[y]) == @a[x] ? x : y
        i += 1
      end
      k += 1
    end
  end

  def [](r : Range)
    sc = Indexable.range_to_index_and_count(r, @n)
    raise ArgumentError.new("Invalid range") if sc.nil?
    start, count = sc
    l, r = start, start + count
    k = @log_table[r - l - 1]
    x = @rmq[k][l]
    y = @rmq[k][r - (1 << k)]
    @compose.call(@a[x], @a[y])
  end


  @n : Int32
  @log_table : Array(Int32)
  @rmq : Array(Array(Int32))
end

solve(ProconIO.new)
0