結果

問題 No.1641 Tree Xor Query
ユーザー yuruhiya
提出日時 2021-08-08 10:07:15
言語 Crystal
(1.14.0)
結果
AC  
実行時間 240 ms / 5,000 ms
コード長 18,897 bytes
コンパイル時間 16,745 ms
コンパイル使用メモリ 295,580 KB
実行使用メモリ 24,136 KB
最終ジャッジ日時 2024-09-19 05:53:58
合計ジャッジ時間 12,676 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

# require "/template"
# require "./scanner"
# ### Specifications
#
# ```plain
# Inside input macro | Expanded code
# ----------------------------------------------+---------------------------------------
# Uppercase string: Int32, Int64, Float64, etc. | {}.new(Scanner.s)
# s | Scanner.s
# c | Scanner.c
# Other lowercase string: i, i64, f, etc. | Scanner.s.to_{}
# operator[]: type[size] | Array.new(input(size)) { input(type) }
# Tuple literal: {t1, t2, t3} | {input(t1), input(t2), input(t3)}
# Array literal: [t1, t2, t3] | [input(t1), input(t2), input(t3)]
# Range literal: t1..t2 | input(t1)..input(t2)
# If: cond ? t1 : t2 | cond ? input(t1) : input(t2)
# Assign: target = value | target = input(value)
# ```
#
# ### Examples
#
# Input:
# ```plain
# 5 3
# foo bar
# 1 2 3 4 5
# ```
# ```
# n, m = input(Int32, Int64) # => {5, 10i64}
# input(String, Char[m]) # => {"foo", ['b', 'a', 'r']}
# input(Int32[n]) # => [1, 2, 3, 4, 5]
# ```
# ```
# n, m = input(i, i64) # => {5, 10i64}
# input(s, c[m]) # => {"foo", ['b', 'a', 'r']}
# input(i[n]) # => [1, 2, 3, 4, 5]
# ```
#
# Input:
# ```plain
# 2 3
# 1 2 3
# 4 5 6
# ```
#
# ```
# h, w = input(i, i) # => {2, 3}
# input(i[h, w]) # => [[1, 2, 3], [4, 5, 6]]
# ```
# ```
# input(i[i][i]) # => [[1, 2, 3], [4, 5, 6]]
# ```
#
# Input:
# ```plain
# 5 3
# 3 1 4 2 5
# 1 2
# 2 3
# 3 1
# ```
# ```
# n, m = input(i, i) # => {5, 3}
# input(i.pred[n]) # => [2, 0, 3, 1, 4]
# input({i - 1, i - 1}[m]) # => [{0, 1}, {1, 2}, {2, 0}]
# ```
#
# Input:
# ```plain
# 3
# 1 2
# 2 2
# 3 2
# ```
# ```
# input({tmp = i, tmp == 1 ? i : i.pred}[i]) # => [{1, 2}, {2, 1}, {3, 1}]
# ```
#
# Input:
# ```plain
# 3
# 1 2
# 2 3
# 3 1
# ```
# ```
# n = input(i)
# input_column({Int32, Int32}, n) # => {[1, 2, 3], [2, 3, 1]}
# ```
class Scanner
private def self.skip_to_not_space
peek = STDIN.peek
not_space = peek.index { |x| x != 32 && x != 10 } || peek.size
STDIN.skip(not_space)
end
def self.c
skip_to_not_space
STDIN.read_char.not_nil!
end
def self.s
skip_to_not_space
peek = STDIN.peek
if index = peek.index { |x| x == 32 || x == 10 }
STDIN.skip(index + 1)
return String.new(peek[0, index])
end
String.build do |buffer|
loop do
buffer.write peek
STDIN.skip(peek.size)
peek = STDIN.peek
break if peek.empty?
if index = peek.index { |x| x == 32 || x == 10 }
buffer.write peek[0, index]
STDIN.skip(index)
break
end
end
end
end
end
macro internal_input(type, else_ast)
{% if Scanner.class.has_method?(type.id) %}
Scanner.{{type.id}}
{% elsif type.stringify == "String" %}
Scanner.s
{% elsif type.stringify == "Char" %}
Scanner.c
{% elsif type.stringify =~ /[A-Z][a-z0-9_]*/ %}
{{type.id}}.new(Scanner.s)
{% elsif String.has_method?("to_#{type}".id) %}
Scanner.s.to_{{type.id}}
{% else %}
{{else_ast}}
{% end %}
end
macro internal_input_array(type, args)
{% for i in 0...args.size %}
%size{i} = input({{args[i]}})
{% end %}
{% begin %}
{% for i in 0...args.size %} Array.new(%size{i}) { {% end %}
input({{type.id}})
{% for i in 0...args.size %} } {% end %}
{% end %}
end
macro input(type)
{% if type.is_a?(Call) %}
{% if type.receiver.is_a?(Nop) %}
internal_input(
{{type.name}}, {{type.name}}(
{% for argument in type.args %} input({{argument}}), {% end %}
)
)
{% elsif type.name.stringify == "[]" %}
internal_input_array({{type.receiver}}, {{type.args}})
{% else %}
input({{type.receiver}}).{{type.name.id}}(
{% for argument in type.args %} input({{argument}}), {% end %}
) {{type.block}}
{% end %}
{% elsif type.is_a?(TupleLiteral) %}
{ {% for i in 0...type.size %} input({{type[i]}}), {% end %} }
{% elsif type.is_a?(ArrayLiteral) %}
[ {% for i in 0...type.size %} input({{type[i]}}), {% end %} ]
{% elsif type.is_a?(RangeLiteral) %}
Range.new(input({{type.begin}}), input({{type.end}}), {{type.excludes_end?}})
{% elsif type.is_a?(If) %}
{{type.cond}} ? input({{type.then}}) : input({{type.else}})
{% elsif type.is_a?(Assign) %}
{{type.target}} = input({{type.value}})
{% else %}
internal_input({{type.id}}, {{type.id}})
{% end %}
end
macro input(*types)
{ {% for type in types %} input({{type}}), {% end %} }
end
macro input_column(types, size)
{% for type, i in types %}
%array{i} = Array({{type}}).new({{size}})
{% end %}
{{size}}.times do
{% for type, i in types %}
%array{i} << input({{type}})
{% end %}
end
{ {% for type, i in types %} %array{i}, {% end %} }
end
# require "./tuple/times"
struct Tuple
def times(&block) : Nil
{% begin %}
{% for i in 0...@type.size %}
{% if @type[i].has_method?(:each) %}
self[{{i}}].each do |i{{i}}|
{% else %}
self[{{i}}].times do |i{{i}}|
{% end %}
{% end %}
yield({% for i in 0...@type.size %} i{{i}}, {% end %})
{% for i in 0...@type.size %} end {% end %}
{% end %}
end
private class TimesIterator(T)
include Iterator(T)
def initialize(@n : T)
tuple = {% begin %}
{ {% for i in 0...T.size %} T[{{i}}].zero, {% end %} }
{% end %}
@index = tuple.as(T)
@first = true
end
def next
if @first
@first = false
return @index
end
{% begin %}
{%
type = @type.type_vars[0]
size = type.size
%}
{% for i in 1..size %}
if @index[{{size - i}}] < @n[{{size - i}}] - 1
@index = {
{% for j in 0...size %}
{% if j < size - i %}
@index[{{j}}],
{% elsif j == size - i %}
@index[{{j}}] + 1,
{% else %}
{{type[j]}}.zero,
{% end %}
{% end %}
}
return @index
end
{% end %}
stop
{% end %}
end
end
def times
TimesIterator(self).new(self)
end
end
# require "./comparable/min_max"
module Comparable(T)
def min(x : T)
self > x ? x : self
end
def max(x : T)
self < x ? x : self
end
end
# require "./array/new"
class Array
def self.new(sizes : Tuple(*T), initial_value) forall T
{% begin %}
{% for i in 0...T.size %} Array.new(sizes[{{i}}]) { {% end %}
initial_value
{% for i in 0...T.size %} } {% end %}
{% end %}
end
def self.new(sizes : Tuple(*T), &block) forall T
{% begin %}
{% for i in 0...T.size %} Array.new(sizes[{{i}}]) { |%i{i}| {% end %}
yield({% for i in 0...T.size %} %i{i}, {% end %})
{% for i in 0...T.size %} } {% end %}
{% end %}
end
end
# require "./array/change"
class Array(T)
def chmin(i : Int, value : T)
(self[i] > value).tap do |f|
self[i] = value if f
end
end
protected def chmin(i : Int, *indexes, value)
self[i].chmin(*indexes, value: value)
end
def chmin(indexes : Tuple, value)
chmin(*indexes, value: value)
end
def chmax(i : Int, value : T)
(self[i] < value).tap do |f|
self[i] = value if f
end
end
protected def chmax(i : Int, *indexes, value)
self[i].chmax(*indexes, value: value)
end
def chmax(indexes : Tuple, value)
chmax(*indexes, value: value)
end
end
# require "/graph/euler_tour_for_vertex"
# require "../graph"
# require "./graph/edge"
struct WeightedEdge(T)
include Comparable(WeightedEdge(T))
property to : Int32, cost : T
def initialize(@to, @cost : T)
end
def <=>(other : WeightedEdge(T))
{cost, to} <=> {other.cost, other.to}
end
def to_s(io) : Nil
io << '(' << to << ", " << cost << ')'
end
def inspect(io) : Nil
io << "->#{to}(#{cost})"
end
end
struct WeightedEdge2(T)
include Comparable(WeightedEdge2(T))
property from : Int32, to : Int32, cost : T
def initialize(@from, @to, @cost : T)
end
def initialize(@from, edge : WeightedEdge(T))
@to, @cost = edge.to, edge.cost
end
def <=>(other : WeightedEdge2(T))
{cost, from, to} <=> {other.cost, other.from, other.to}
end
def reverse
WeightedEdge2(T).new(to, from, cost)
end
def sort
WeightedEdge2(T).new(*{to, from}.minmax, cost)
end
def to_s(io) : Nil
io << '(' << from << ", " << to << ", " << cost << ')'
end
def inspect(io) : Nil
io << from << "->" << to << '(' << cost << ')'
end
end
struct UnweightedEdge
property to : Int32
def initialize(@to)
end
def initialize(@to, cost)
end
def cost
1
end
def to_s(io) : Nil
io << to
end
def inspect(io) : Nil
io << "->" << to
end
end
struct UnweightedEdge2
property from : Int32, to : Int32
def initialize(@from, @to)
end
def initialize(@from, @to, cost)
end
def initialize(@from, edge : UnweightedEdge)
@to = edge.to
end
def cost
1
end
def reverse
UnweightedEdge2.new(to, from)
end
def sort
UnweightedEdge2.new(*{to, from}.minmax)
end
def to_s(io) : Nil
io << '(' << from << ", " << to << ')'
end
def inspect(io) : Nil
io << from << "->" << to
end
end
module Graph(Edge, Edge2)
include Enumerable(Edge2)
getter graph : Array(Array(Edge))
def initialize(size : Int)
@graph = Array(Array(Edge)).new(size) { [] of Edge }
end
def initialize(size : Int, edges : Enumerable)
initialize(size)
add_edges(edges)
end
# Add *edge*.
abstract def <<(edge : Edge2)
# :ditto:
def <<(edge : Tuple)
self << Edge2.new(*edge)
end
def add_edges(edges : Enumerable)
edges.each { |edge| self << edge }
end
delegate size, to: @graph
delegate :[], to: @graph
# Yields each edge of the graph, ans returns `nil`.
def each(&) : Nil
(0...size).each do |v|
self[v].each do |edge|
yield Edge2.new(v, edge)
end
end
end
def reverse
if self.class.directed?
each_with_object(self.class.new(size)) do |edge, reversed|
reversed << edge.reverse
end
else
dup
end
end
def to_undirected
if self.class.directed?
each_with_object(self.class.new(size)) do |edge, graph|
graph << edge
graph << edge.reverse if self.class.directed?
end
else
dup
end
end
def to_s(io : IO) : Nil
io << '['
join(", ", io) do |edge, io|
edge.inspect io
end
io << ']'
end
def inspect(io : IO) : Nil
io << "[\n"
graph.each do |edges|
io << " " << edges << ",\n"
end
io << ']'
end
end
class DirectedGraph(T)
include Graph(WeightedEdge(T), WeightedEdge2(T))
def initialize(size : Int)
super
end
def initialize(size : Int, edges : Enumerable(WeightedEdge2(T)))
super
end
def initialize(size : Int, edges : Enumerable({Int32, Int32, T}))
super
end
def <<(edge : WeightedEdge2(T))
raise IndexError.new unless 0 <= edge.from < size && 0 <= edge.to < size
@graph[edge.from] << WeightedEdge.new(edge.to, edge.cost)
self
end
def self.weighted?
true
end
def self.directed?
true
end
end
class UndirectedGraph(T)
include Graph(WeightedEdge(T), WeightedEdge2(T))
def initialize(size : Int)
super
end
def initialize(size : Int, edges : Enumerable(WeightedEdge2(T)))
super
end
def initialize(size : Int, edges : Enumerable({Int32, Int32, T}))
super
end
def <<(edge : WeightedEdge2(T))
raise IndexError.new unless 0 <= edge.from < size && 0 <= edge.to < size
@graph[edge.from] << WeightedEdge.new(edge.to, edge.cost)
@graph[edge.to] << WeightedEdge.new(edge.from, edge.cost)
self
end
def self.weighted?
true
end
def self.directed?
false
end
end
class UnweightedDirectedGraph
include Graph(UnweightedEdge, UnweightedEdge2)
def initialize(size : Int)
super
end
def initialize(size : Int, edges : Enumerable)
super
end
def <<(edge : UnweightedEdge2)
raise IndexError.new unless 0 <= edge.from < size && 0 <= edge.to < size
@graph[edge.from] << UnweightedEdge.new(edge.to)
self
end
def self.weighted?
false
end
def self.directed?
true
end
end
class UnweightedUndirectedGraph
include Graph(UnweightedEdge, UnweightedEdge2)
def initialize(size : Int)
super
end
def initialize(size : Int, edges : Enumerable)
super
end
def <<(edge : UnweightedEdge2)
raise IndexError.new unless 0 <= edge.from < size && 0 <= edge.to < size
@graph[edge.from] << UnweightedEdge.new(edge.to)
@graph[edge.to] << UnweightedEdge.new(edge.from)
self
end
def each_child(vertex : Int, parent, &block) : Nil
graph[vertex].each do |u|
yield u if u != parent
end
end
def each_child(vertex : Int, parent)
graph[vertex].each.select { |u| u != parent }
end
def self.weighted?
false
end
def self.directed?
false
end
end
class EulerTourForVertex
getter graph : UnweightedUndirectedGraph
def initialize(@graph)
@ls = Array(Int32).new(size, 0)
@rs = Array(Int32).new(size, 0)
@k = 0
end
delegate size, to: @graph
delegate :[], to: @graph
delegate add_edge, to: @graph
def dfs(v : Int, p : Int) : Nil
@ls[v] = @k
@k += 1
@graph[v].each do |edge|
dfs(edge.to, v) if edge.to != p
end
@rs[v] = @k
end
def run(root : Int)
dfs(root, -1)
{@ls, @rs}
end
end
# require "atcoder/SegTree"
# ac-library.cr by hakatashi https://github.com/google/ac-library.cr
#
# Copyright 2021 Google LLC
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# https://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
module AtCoder
# Implements [atcoder::segtree](https://atcoder.github.io/ac-library/master/document_en/segtree.html).
#
# The identity element will be implicitly defined as nil, so you don't
# have to manually define it. In the other words, you cannot include
# nil into an element of the monoid.
#
# ```
# tree = AtCoder::SegTree.new((0...100).to_a) { |a, b| [a, b].min }
# tree[10...50] # => 10
# ```
class SegTree(T)
property values : Array(T)
def initialize(values : Array(T))
initialize(values) { |a, b| a > b ? a : b }
end
def initialize(values : Array(T), &@operator : T, T -> T)
@values = values
@segments = Array(T | Nil).new(2 ** ::Math.log2(values.size).ceil.to_i - 1, nil)
# initialize segments
(@segments.size - 1).downto(0) do |i|
child1 = nil.as(T | Nil)
child2 = nil.as(T | Nil)
if i * 2 + 1 < @segments.size
child1 = @segments[i * 2 + 1]
child2 = @segments[i * 2 + 2]
else
if i * 2 + 1 - @segments.size < @values.size
child1 = @values[i * 2 + 1 - @segments.size]
end
if i * 2 + 2 - @segments.size < @values.size
child2 = @values[i * 2 + 2 - @segments.size]
end
end
@segments[i] = operate(child1, child2)
end
end
@[AlwaysInline]
private def operate(a : T | Nil, b : T | Nil)
if a.nil?
b
elsif b.nil?
a
else
@operator.call(a, b)
end
end
# Implements atcoder::segtree.set(index, value)
def []=(index : Int, value : T)
@values[index] = value
parent_index = (index + @segments.size - 1) // 2
while parent_index >= 0
i = parent_index
child1 = nil.as(T | Nil)
child2 = nil.as(T | Nil)
if i * 2 + 1 < @segments.size
child1 = @segments[i * 2 + 1]
child2 = @segments[i * 2 + 2]
else
if i * 2 + 1 - @segments.size < @values.size
child1 = @values[i * 2 + 1 - @segments.size]
end
if i * 2 + 2 - @segments.size < @values.size
child2 = @values[i * 2 + 2 - @segments.size]
end
end
@segments[i] = operate(child1, child2)
parent_index = (parent_index - 1) // 2
end
end
# Implements atcoder::segtree.get(index)
def [](index : Int)
@values[index]
end
# Implements atcoder::segtree.prod(l, r)
def [](range : Range(Int, Int))
a = range.begin
b = range.exclusive? ? range.end : range.end + 1
get_value(a, b, 0, 0...(@segments.size + 1)).not_nil!
end
def get_value(a : Int, b : Int, segment_index : Int, range : Range(Int, Int))
if range.end <= a || b <= range.begin
return nil
end
if a <= range.begin && range.end <= b
if segment_index < @segments.size
return @segments[segment_index]
else
return @values[segment_index - @segments.size]
end
end
range_median = (range.begin + range.end) // 2
child1 = get_value(a, b, 2 * segment_index + 1, range.begin...range_median)
child2 = get_value(a, b, 2 * segment_index + 2, range_median...range.end)
operate(child1, child2)
end
# compatibility with ac-library
# Implements atcoder::segtree.set(index, value)
# alias of `.[]=`
def set(index : Int, value : T)
self.[]=(index, value)
end
# Implements atcoder::segtree.get(index)
# alias of `.[]`
def get(index : Int)
self.[](index)
end
# Implements atcoder::segtree.prod(left, right)
def prod(left : Int, right : Int)
self.[](left...right)
end
# Implements atcoder::segtree.all_prod(l, r)
def all_prod
self.[](0...@values.size)
end
# FIXME: Unimplemented
def max_right
raise NotImplementedError.new
end
# FIXME: Unimplemented
def max_left
raise NotImplementedError.new
end
end
end
n, q = input(i, i)
c = input(i64[n])
graph = UnweightedUndirectedGraph.new n, input({i - 1, i - 1}[n - 1])
euler = EulerTourForVertex.new(graph)
ls, rs = euler.run(0)
seg = AtCoder::SegTree.new([0i64] * n) { |x, y| x ^ y }
ls.each_with_index { |x, i| seg[x] = c[i] }
q.times do
t, x, y = input(i, i - 1, i)
case t
when 1
seg[ls[x]] ^= y
when 2
puts seg[ls[x]...rs[x]]
end
end
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0