提出 #23482710

---

ソースコード 拡げる

N1 = 1+N = gets.to_i
E = Array.new(N1){[]}; (N-1).times{
	a,b = gets.split.map(&:to_i)
	E[a] << b
	E[b] << a
}

P = [0]+[nil]*N
D = [0]+[nil]*N
O = [0]+[nil]*N
*S = P[1] = D[1] = o = 1
while a = S.pop
	p,d,O[a] = P[a],D[a]+1,o+=1
	E[a].each{|b|
		next if b==p
		P[b],D[b] = a,d
		S << b
	}
end

A = [ps=P.dup]
(D.max-1).bit_length.times{
	A << ps = N1.times.map{|a| ps[ps[a]] }
}

Ans = lambda{|a,dd|
	i = 0
	while 0<dd
		a = A[i][a] if 0<dd&1
		dd >>= 1
		i += 1
	end
	next a
}
Dst = lambda{|(a,b)|
	da,db = D[a],D[b]
	dc = (1..[da,db].min).bsearch{|dc|
		Ans[a,da-dc] != Ans[b,db-dc]
	}
	next dc ? da-dc+db-dc+2 : (da-db).abs
}

puts gets.to_i.times.map{
	k,*as = gets.split.map(&:to_i)
	as.sort_by!{|a| O[a] }
	as << as[0]
	next as.each_cons(2).sum(&Dst)/2
}

提出情報

コンパイルエラー

./Main.rb:44: warning: assigned but unused variable - k

ジャッジ結果