提出 #18053537

---

ソースコード 拡げる

class Array
	def ^ other # Both of self and other must be unique and sorted.
		i,*a = j = t = 0
		ix,jx,v = self.size,other.size
		begin
			(i+=1; j+=1) while (v = other[j]) && self[i] == v
			a.concat self[i...i+=t] if 0 < t = v ? self[i,ix].bsearch_index{ v<=_1 }||ix-i : ix-i
			a.concat other[j...j+=t] if 0 < t = (v = self[i]) ? other[j,jx].bsearch_index{ v<=_1 }||jx-j : jx-j
		end while v
		return a
	end
end

N,Q = gets.split.map(&:to_i)

ChildrenOfV = Array.new(N+1){ {} }
ParentOfV = [nil]*(N+1)
ColorOfV = Array.new(N+1){ [] }
EdgeOfV = [nil]*(N+1)
ColorOfE = [nil]*(N-1)

Edges = (N-1).times.map{
	a,b = gets.split.map(&:to_i)
	ChildrenOfV[a][b] = b
	ChildrenOfV[b][a] = a
	next a,b
}

Colors = Q.times.map{|z|
	u,v,c = gets.split.map(&:to_i)
	ColorOfV[u] << z
	ColorOfV[v] << z
	next c
}
Colors << 0

i,子を認知する親の行列 = -1,[N]
子を認知する親の行列.concat ChildrenOfV[p=子を認知する親の行列[i]].each{|c,|
	ParentOfV[c] = ChildrenOfV[c].delete p
}.keys while (i+=1) < 子を認知する親の行列.size

Edges.each_with_index{|(p,c),i|
	EdgeOfV[ParentOfV[c] == p ? c : p] = i
}

子を認知する親の行列.shift
子を認知する親の行列.reverse_each{|p|
	ColorOfV[p] = ChildrenOfV[p].map{|u,| _,ColorOfV[u] = ColorOfV[u],nil; _ }.inject(ColorOfV[p],:^)
	ColorOfE[EdgeOfV[p]] = Colors[ColorOfV[p].max||-1]
	ChildrenOfV[p] = nil
}

Kernel.p *ColorOfE

提出情報

コンパイルエラー

./Main.rb:53: warning: `*' interpreted as argument prefix

ジャッジ結果