Paint House III

Given m houses (some already painted and cannot be repainted) and n colors with painting costs, paint the remaining houses to produce exactly target contiguous color groups (neighborhoods) while minimizing total cost — a dynamic-programming state-space problem over position, chosen color, and neighborhood count (return -1 if impossible).