結果
問題 | No.777 再帰的ケーキ |
ユーザー |
|
提出日時 | 2021-07-21 13:18:42 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 254 ms / 2,000 ms |
コード長 | 6,753 bytes |
コンパイル時間 | 15,234 ms |
コンパイル使用メモリ | 313,948 KB |
実行使用メモリ | 46,264 KB |
最終ジャッジ日時 | 2024-07-17 13:59:22 |
合計ジャッジ時間 | 18,258 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 33 |
コンパイルメッセージ
In Main.cr:139:19 139 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:15 140 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:139:19 139 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:15 140 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:139:19 139 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:15 140 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:139:19 139 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:15 140 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:139:19 139 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:15 140 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:139:19 139 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:15 140 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:139:19 139 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use
ソースコード
def solve(io)n = io.geta, 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|max_u(st[di.b], st[di.b+1..] + di.c)endio.put st[0..]endrecord Cake, a : Int32, b : Int32, c : Int64struct Intdef cdiv(b : Int)(self + b - 1) // benddef bit?(i : Int)bit(i) == 1enddef set_bit(i : Int)self | (self.class.new(1) << i)enddef 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 : Int32x = self < 0 ? ~self : selfif x.is_a?(Int::Primitive)Int32.new(sizeof(self) * 8 - x.leading_zeros_count)elseto_s(2).sizeendend{% end %}endstruct Int32SQRT_MAX = 46_340_i32def isqrtm = SQRT_MAXr = (1_i32..SQRT_MAX).bsearch { |i| i**2 > self }r.nil? ? SQRT_MAX : r - 1endendstruct Int64SQRT_MAX = 3_037_000_499_i64def isqrtr = (1_i64..SQRT_MAX).bsearch { |i| i**2 > self }r.nil? ? SQRT_MAX : r - 1endendstruct Float64def near_zero?self.abs < EPSILONendendstruct Number{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.1.0") < 0 %}def zero?self == 0enddef positive?self > 0enddef negative?self < 0end{% end %}{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.36.0") < 0 %}def self.additive_identityzeroenddef self.multiplicative_identitynew(1)end{% end %}endclass Arraymacro 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 %}endendclass ProconIOdef initialize(@ins : IO = STDIN, @outs : IO = STDOUT)@buf = IO::Memory.new("")enddef get(k : T.class = Int32) forall Tget_v(k)endmacro 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 %}enddefine_getmacro define_getn{% for i in (2..9) %}def get{{i}}(k : T.class = Int32) forall Tget({{ *(1..i).map { "k".id } }})end{% end %}enddefine_getndef get_a(n : Int, k : T.class = Int32) forall TArray.new(n) { get_v(k) }enddef get_c(n : Int, k : T.class = Int32) forall Tget_a(n, k)endmacro 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 %}enddefine_get_cmacro define_getn_c{% for i in (2..9) %}def get{{i}}_c(n : Int, k : T.class = Int32) forall Tget_c(n, {{ *(1..i).map { "k".id } }})end{% end %}enddefine_getn_cdef get_m(r : Int, c : Int, k : T.class = Int32) forall TArray.new(r) { get_a(c, k) }endmacro 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.putsend{% end %}enddefine_putdef put_e(*vs)put(*vs)exitenddef put_f(*vs)put(*vs)@outs.flushendprivate def get_v(k : Int32.class); get_token.to_i32; endprivate def get_v(k : Int64.class); get_token.to_i64; endprivate def get_v(k : UInt32.class); get_token.to_u32; endprivate def get_v(k : UInt64.class); get_token.to_u64; endprivate def get_v(k : Float64.class); get_token.to_f64; endprivate def get_v(k : String.class); get_token; endprivate def get_tokenloop dotoken = @buf.gets(' ', chomp: true)break token unless token.nil?@buf = IO::Memory.new(@ins.read_line)endendprivate def print_v(v, dlimiter)@outs << vendprivate def print_v(v : Enumerable, delimiter)v.each_with_index do |e, i|@outs << e@outs << delimiter if i < v.size - 1endendendmacro min_u(a, b){{a}} = Math.min({{a}}, {{b}})endmacro max_u(a, b){{a}} = Math.max({{a}}, {{b}})endmacro zip(a, *b, &block){{a}}.zip({{*b}}) {{block}}endclass Zaatsu(T)def initialize(*v : Array(T))@c1 = Hash(T, Int32).newv.each do |w|w.each do |e|@c1[e] = 0endend@size = @c1.size@c2 = Array(T).new(@size)@c1.keys.sort.each_with_index do |k, i|@c1[k] = i@c2 << kendendgetter size : Int32def comp(v : T)@c1[v]enddef uncomp(v : Int)@c2[v]end@c1 : Hash(T, Int32)@c2 : Array(T)endclass 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_allenddef 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] = bpropagate_allenddef [](i : Int)@buf[i + @an]enddef [](start : Int, count : Int)l, r = start + @an, start + count + @anr1 = r2 = @initwhile l != rif l.odd?r1 = @compose.call(r1, @buf[l])l += 1endif r.odd?r -= 1r2 = @compose.call(@buf[r], r2)endl >>= 1r >>= 1end@compose.call(r1, r2)enddef [](r : Range)sc = Indexable.range_to_index_and_count(r, @n)raise ArgumentError.new("Invalid range") if sc.nil?self[*sc]enddef []=(i : Int, v : T)@buf[i + @an] = vpropagate(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])endendprivate def propagate(i : Int)while (i >>= 1) > 0@buf[i] = @compose.call(@buf[i << 1], @buf[i << 1 | 1])endendendsolve(ProconIO.new)