結果
問題 | No.778 クリスマスツリー |
ユーザー |
|
提出日時 | 2021-07-21 15:44:46 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 221 ms / 2,000 ms |
コード長 | 8,795 bytes |
コンパイル時間 | 14,466 ms |
コンパイル使用メモリ | 304,296 KB |
実行使用メモリ | 47,724 KB |
最終ジャッジ日時 | 2024-07-17 14:02:13 |
合計ジャッジ時間 | 15,222 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
コンパイルメッセージ
In Main.cr:140:19 140 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:141:15 141 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:19 140 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:141:15 141 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:19 140 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:141:15 141 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:19 140 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:141:15 141 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:19 140 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:141:15 141 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:19 140 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:141:15 141 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:140:19 140 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use
ソースコード
def solve(io)n = io.getg = Graph.new(n)(n-1).times do |i|ai = io.getg.add_edge_b(i+1, ai)endt = g.tree(0)e = t.euler_tourf = FenwickTree(Int32).new(e.path.size)r = 0_i64(0...n).reverse_each do |u|r += f[e.in_time[u]..e.out_time[u]]f.add(e.in_time[u], 1)endio.put rendstruct 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 FenwickTree(T)def initialize(@n : Int32)@b = Array.new(@n + 1, T.additive_identity)enddef [](i : Int)self[i..i]enddef [](start : Int, count : Int)get(start + count) - get(start)enddef [](r : Range)sc = Indexable.range_to_index_and_count(r, @n)raise ArgumentError.new("Invalid range") if sc.nil?self[*sc]enddef add(i : Int, val : T)i += 1while i <= @n@b[i] += vali += i & -iendend@b : Array(T)private def get(i : Int)s = T.additive_identitywhile i > 0s += @b[i]i -= i & -iendsendendrequire "bit_array"class Graphalias Node = Int32def initialize(@size : Node)@g = Array(Array(Node)).new(@size) { [] of Node }endgetter size : Int32delegate :[], to: @gdef add_edge(u : Node, v : Node)@g[u] << venddef add_edge_b(u : Node, v : Node)@g[u] << v@g[v] << uenddef bfs(u : Node)b = BitArray.new(@size)yield u, -1b[u] = trueq = Deque.new([u])until q.empty?v = q.shift@g[v].each do |w|next if b[w]yield w, vb[w] = trueq.push(w)endendendendclass GraphW(T)alias Node = Int32struct Edge(T)def initialize(@src : Node, @dst : Node, @wt : T)endgetter src : Node, dst : Nodegetter wt : Tenddef initialize(@size : Node, @inf = 10**9)@g = Array(Array(Edge(T))).new(@size) { [] of Edge(T) }endgetter size : Int32getter inf : Tdelegate :[], to: @gdef add_edge(u : Node, v : Node, wt : T)@g[u] << Edge.new(u, v, wt)enddef add_edge_b(u : Node, v : Node, wt : T)@g[u] << Edge.new(u, v, wt)@g[v] << Edge.new(v, u, wt)endendclass GraphM(T)alias Node = Int32def initialize(@size : Int32, @inf = 10**9)@g = Array.new_md(@size, @size, @inf)@size.times do |i|@g[i][i] = T.zeroendendgetter size : Int32getter inf : Tdelegate :[], to: @gdef add_edge(u : Node, v : Node, wt : T)@g[u][v] = wtenddef add_edge_b(u : Node, v : Node, wt : T)@g[u][v] = @g[v][u] = wtend@g : Array(Array(T))endclass Treealias Node = Graph::Nodedef initialize(@g : Graph, @root : Node)size = @g.size@parent = Array.new(size, 0)@children = Array.new(size) { [] of Node }@depth = Array.new(size, -1)@dfs_order = [] of Nodes = [{@root, @root}]until s.empty?u, p = s.pop@parent[u] = p@depth[u] = @depth[p] + 1@dfs_order << u@g[u].each do |v|if v != p@children[u] << vs.push({v, u})endendend@descendant_size = Array.new(size, 1)@dfs_order.reverse_each do |u|@descendant_size[@parent[u]] += @descendant_size[u] if u != @rootendenddelegate size, to: @ggetter root : Nodegetter dfs_order : Array(Node)getter parent : Array(Node)getter children : Array(Array(Node))getter depth : Array(Int32)getter descendant_size : Array(Int32)endclass Graphdef tree(root)Tree.new(self, root)endendclass EulerTouralias Node = Graph::Nodedef initialize(t : Tree)@path = [] of Node@in_time = Array.new(t.size, 0)@out_time = Array.new(t.size, 0)s = [~t.root, t.root]c = -1until s.empty?u = s.popc += 1if u < 0@path << ~u@out_time[~u] = celse@path << u@in_time[u] = cchildren = t.children[u]children.each_with_index do |v, i|s.push(~v)s.push(v)s.push(~u) if i < children.size - 1endendendendgetter path : Array(Node)getter in_time : Array(Int32)getter out_time : Array(Int32)endclass Treedef euler_tourEulerTour.new(self)endendsolve(ProconIO.new)