提出 #10470513

---

ソースコード 拡げる

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

Friends = Array.new(N+1){ {} }
M.times{
	a, b = gets.split.map(&:to_i)
	Friends[a][b] = Friends[b][a] = true
}

Blocks = Array.new(N+1){ {} }
K.times{
	c, d = gets.split.map(&:to_i)
	Blocks[c][d] = Blocks[d][c] = true
}

F = [*0..N]
Friends.each_with_index{|h,i|
	next if h.empty?
	js = [i] + h.keys
	min = js.map{|j| F[j] }.min
	js.each{|j|
		F[j] = min
	}
}

G = Array.new(N+1){ {} }
F.each_with_index{|x,i|
	G[x][i] = true
}

puts N.times.map{|_| n = _+1
	(G[F[n]].keys-Blocks[n].keys-Friends[n].keys-[n]).size
}*' '

提出情報

ジャッジ結果