#679940 (Crystal) No.777 再帰的ケーキ

提出ソース

結果

問題	No.777 再帰的ケーキ
ユーザー	te-sh
提出日時	2021-07-21 12:34:10
言語	Crystal (1.11.2)
結果	WA
実行時間	-
コード長	6,747 bytes
コンパイル時間	25,121 ms
コンパイル使用メモリ	266,020 KB
実行使用メモリ	51,188 KB
最終ジャッジ日時	2023-09-24 13:03:43
合計ジャッジ時間	26,018 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,504 KB
testcase_01	AC	2 ms 4,528 KB
testcase_02	AC	2 ms 4,412 KB
testcase_03	AC	2 ms 4,560 KB
testcase_04	AC	2 ms 4,484 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	2 ms 4,500 KB
testcase_07	AC	2 ms 4,484 KB
testcase_08	AC	3 ms 4,480 KB
testcase_09	AC	3 ms 4,420 KB
testcase_10	AC	2 ms 4,408 KB
testcase_11	AC	2 ms 4,496 KB
testcase_12	AC	2 ms 4,380 KB
testcase_13	AC	2 ms 4,376 KB
testcase_14	AC	3 ms 4,436 KB
testcase_15	AC	2 ms 4,564 KB
testcase_16	AC	2 ms 4,472 KB
testcase_17	AC	3 ms 4,512 KB
testcase_18	WA	-
testcase_19	AC	3 ms 4,376 KB
testcase_20	AC	3 ms 4,440 KB
testcase_21	AC	5 ms 5,072 KB
testcase_22	AC	4 ms 5,048 KB
testcase_23	AC	3 ms 4,972 KB
testcase_24	AC	3 ms 4,912 KB
testcase_25	AC	5 ms 5,000 KB
testcase_26	AC	5 ms 5,188 KB
testcase_27	AC	4 ms 4,924 KB
testcase_28	AC	238 ms 46,548 KB
testcase_29	AC	243 ms 45,748 KB
testcase_30	AC	253 ms 47,800 KB
testcase_31	AC	255 ms 46,672 KB
testcase_32	AC	177 ms 51,188 KB
testcase_33	AC	80 ms 19,232 KB
testcase_34	AC	120 ms 26,804 KB
testcase_35	AC	178 ms 34,320 KB
testcase_36	AC	170 ms 49,524 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

def solve(io)
  n = io.get
  a, b, c = io.get_c(n, Int32, Int32, Int64)

  za = Zaatsu.new(b)
  d = Array.new(n) { |i| Cake.new(a[i], za.comp(b[i]), c[i]) }

  d.sort_by! { |di| {-di.a, di.b, -di.c} }
  d.uniq! { |di| {di.a, di.b} }

  st = SegmentTree(Int64).new(za.size) { |a, b| {a, b}.max }
  d.each do |di|
    st[di.b] = st[di.b+1..] + di.c
  end

  io.put st[0..]
end

record Cake, a : Int32, b : Int32, c : Int64

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 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

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

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

class SegmentTree(T)
  def initialize(@n : Int32, @init : T = T.zero, &@compose : (T, T) -> T)
    @an = 1 << (@n - 1).bit_length
    @buf = Array.new(@an << 1, @init)
    propagate_all
  end

  def initialize(b : Array(T), @init : T = T.zero, &@compose : (T, T) -> T)
    @n = b.size
    @an = 1 << (@n - 1).bit_length
    @buf = Array.new(@an << 1, @init)
    @buf[@an, @n] = b
    propagate_all
  end

  def [](i : Int)
    @buf[i + @an]
  end

  def [](start : Int, count : Int)
    l, r = start + @an, start + count + @an
    r1 = r2 = @init
    while l != r
      if l.odd?
        r1 = @compose.call(r1, @buf[l])
        l += 1
      end
      if r.odd?
        r -= 1
        r2 = @compose.call(@buf[r], r2)
      end
      l >>= 1
      r >>= 1
    end
    @compose.call(r1, r2)
  end

  def [](r : Range)
    sc = Indexable.range_to_index_and_count(r, @n)
    raise ArgumentError.new("Invalid range") if sc.nil?
    self[*sc]
  end

  def []=(i : Int, v : T)
    @buf[i + @an] = v
    propagate(i + @an)
  end


  @an : Int32
  @buf : Array(T)

  private def propagate_all
    (1...@an).reverse_each do |i|
      @buf[i] = @compose.call(@buf[i << 1], @buf[i << 1 | 1])
    end
  end

  private def propagate(i : Int)
    while (i >>= 1) > 0
      @buf[i] = @compose.call(@buf[i << 1], @buf[i << 1 | 1])
    end
  end
end

solve(ProconIO.new)

yukicoder

結果

テストケース

ソースコード