Submission #18059514

---

Source Code Expand

class Array
	def ^ other # Both of self and other must be unique and sorted.
		i,v,*a = j = t = 0
		ix,jx = 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)
ColorsOfV = 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
}

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

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

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

子の色リストスタック = []
ET.shift
ET.reverse_each{|p|
	cn = ChildrenOfV[p].size
	子の色リストスタック.push (0 < cn ? 子の色リストスタック.pop(cn).delete_if(&:empty?).inject(ColorsOfV[p],:^) : ColorsOfV[p])
	ColorOfE[EdgeOfV[p]] = Colors[子の色リストスタック[-1][-1]||-1]
}

Kernel.p *ColorOfE

Submission Info

Compile Error

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

Judge Result