結果
問題 | No.1705 Mode of long array |
ユーザー |
|
提出日時 | 2022-02-17 14:34:41 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 183 ms / 3,000 ms |
コード長 | 8,555 bytes |
コンパイル時間 | 14,366 ms |
コンパイル使用メモリ | 304,560 KB |
実行使用メモリ | 22,272 KB |
最終ジャッジ日時 | 2024-06-29 07:40:19 |
合計ジャッジ時間 | 22,289 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 51 |
コンパイルメッセージ
In Main.cr:39:19 39 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:40:15 40 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:39:19 39 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:40:15 40 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:39:19 39 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:40:15 40 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:39:19 39 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:40:15 40 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:39:19 39 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:40:15 40 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:39:19 39 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:40:15 40 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:39:19 39 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:40:15 40
ソースコード
def solve(io)n, m = io.get(Int64, Int32)a = io.get_a(m, Int64)b = [{0_i64, 0}] + a.map_with_index { |ai, i| {ai, i+1} }st = SegmentTree.new(b, :max, {0_i64, 0})q = io.getq.times doti, xi, yi = io.get(Int32, Int32, Int64)case tiwhen 1c = st[xi]st[xi] = {c[0]+yi, c[1]}when 2c = st[xi]st[xi] = {c[0]-yi, c[1]}when 3c = st[0..-1]io.put c[1]endendendrecord Pair, v : Int32, a : Int64class 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_t{% for i in (2..9) %}def get_t(n : Int, {{ *(1..i).map { |j| "k#{j}".id } }})Array.new(n) { get({{ *(1..i).map { |j| "k#{j}".id } }}) }end{% end %}enddefine_get_tmacro define_getn_t{% for i in (2..9) %}def get{{i}}_t(n : Int, k : T.class = Int32) forall Tget_t(n, {{ *(1..i).map { "k".id } }})end{% end %}enddefine_getn_tmacro define_get_c{% for i in (2..9) %}def get_c(n : Int, {{ *(1..i).map { |j| "k#{j}".id } }})a = get_t(n, {{ *(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) }enddef put(*v)@outs.puts(*v)enddef put_e(*v)put(*v)exitenddef put_a(*v)put_d(*v, delimiter: ' ')enddef put_ae(*v)put_a(*v)exitenddef put_c(*v)put_d(*v, delimiter: '\n')enddef put_ce(*v)put_c(*v)exitenddef put_d(*v, delimiter)v.each_with_index do |vi, i|vi.each_with_index do |vij, j|@outs.print vij@outs.print delimiter if j < vi.size - 1end@outs.print delimiter if i < v.size - 1end@outs.putsendprivate def get_v(k : String.class); get_token; endprivate def get_v(k : Int32.class); get_token.to_i32; endprivate def get_v(k : Int64.class); get_token.to_i64; endprivate def get_tokenloop dotoken = @buf.gets(' ', chomp: true)break token unless token.nil?@buf = IO::Memory.new(@ins.read_line)endendendmacro min_u(a, b){{a}} = { {{a}}, {{b}} }.minendmacro max_u(a, b){{a}} = { {{a}}, {{b}} }.maxendmacro records(rec, a){{a}}.map { |v| {{rec}}.new(*v) }endstruct 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 %}endstruct 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.35.0") < 0 %}def digits(base = 10)raise ArgumentError.new("Invalid base #{base}") if base < 2raise ArgumentError.new("Can't request digits of negative number") if self < 0return [0] if self == 0num = selfdigits_count = (Math.log(self.to_f + 1) / Math.log(base)).ceil.to_iary = Array(Int32).new(digits_count)while num != 0ary << num.remainder(base).to_inum = num.tdiv(base)endaryend{% 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 %}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 %}endendmodule 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 < 0return value if value < 2res = value.class.zerobit = res.succ << (res.leading_zeros_count - 2)bit >>= value.leading_zeros_count & ~0x3while (bit != 0)if value >= res + bitvalue -= res + bitres = (res >> 1) + bitelseres >>= 1endbit >>= 2endresend{% end %}endmodule Binary(T)extend selfdef get(op : Symbol) : (T, T) -> Tcase opwhen :+ then return ->add(T, T)when :* then return ->mul(T, T)when :min then return ->min(T, T)when :max then return ->max(T, T)endraise ArgumentError.new("not supported operator")enddef add(a : T, b : T) : Tif a.responds_to?(:+)r = a + breturn r if r.is_a?(T)endraise NotImplementedError.new("this type does not support '+'")enddef mul(a : T, b : T) : Tif a.responds_to?(:*)r = a * breturn r if r.is_a?(T)endraise NotImplementedError.new("this type does not support '*'")enddef min(a : T, b : T) : Tif a.responds_to?(:<=>)r = Math.min(a, b)return r if r.is_a?(T)endraise NotImplementedError.new("this type does not support 'min'")enddef max(a : T, b : T) : Tif a.responds_to?(:<=>)r = Math.max(a, b)return r if r.is_a?(T)endraise NotImplementedError.new("this type does not support 'max'")endendclass 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)init_propagateenddef 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] = binit_propagateenddef initialize(@n : Int32, op : Symbol, @init : T = T.zero)initialize(@n, @init, &Binary(T).get(op))enddef initialize(b : Array(T), op : Symbol, @init : T = T.zero)initialize(b, @init, &Binary(T).get(op))enddef [](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 init_propagate(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)