結果

問題 No.817 Coin donation
ユーザー te-sh
提出日時 2021-07-10 15:24:24
言語 Crystal
(1.14.0)
結果
AC  
実行時間 174 ms / 2,000 ms
コード長 5,671 bytes
コンパイル時間 13,729 ms
コンパイル使用メモリ 303,564 KB
実行使用メモリ 25,600 KB
最終ジャッジ日時 2024-07-02 02:32:26
合計ジャッジ時間 15,798 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 14
権限があれば一括ダウンロードができます
コンパイルメッセージ
In Main.cr:271:16

 271 | {{a}}.zip({{*b}}) {{block}}
                    ^
Warning: Deprecated use of splat operator. Use `#splat` instead

A total of 1 warnings were found.

ソースコード

diff #
プレゼンテーションモードにする

def solve(io)
  n, k = io.get2
  a, b = io.get2_c(n)
  am = a.map(&.- 1)
  bp = b.map(&.+ 1)
  z = Zaatsu.new(a, b, am, bp)
  c = Array.new(z.size + 1, 0)
  zip(a, b).each do |ai, bi|
    c[z.comp(ai)] += 1
    c[z.comp(bi+1)] -= 1
  end
  z.size.times do |i|
    c[i+1] += c[i]
  end
  z.size.times do |i|
    m = c[i] * (z.uncomp(i+1) - z.uncomp(i))
    if k > m
      k -= m
    else
      io.put_e z.uncomp(i) + (k-1)//c[i]
    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 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
  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
class Zaatsu(T)
  def initialize(*v : Array(T))
    @c1 = Hash(T, Int32).new
    v.each do |w|
      w.each do |e|
        @c1[e] = 0
      end
    end
    @size = @c1.size
    @c2 = Array(T).new(@size)
    @c1.keys.sort.each_with_index do |k, i|
      @c1[k] = i
      @c2 << k
    end
  end
  getter size : Int32
  def comp(v : T)
    @c1[v]
  end
  def uncomp(v : Int)
    @c2[v]
  end
  @c1 : Hash(T, Int32)
  @c2 : Array(T)
end
solve(ProconIO.new)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0