1. Solvable by divide ad conquer when d is 2. Should not be too different
when d is no more than 5.
2. It seems doable by union-and-find. Changing a color is equivlent to
adding a single node to adcacent groups, and removing it from some other
groups.
3. No idea.
--
※ 發信站: 批踢踢兔(ptt2.cc)
◆ From: 220.137.87.217