The problem: INPUT: say that we have a M task that we MUST do, for each task i you can do it from Xi to Yi (an interval of hours)

and you must use each task for minimim of X hours and X <=(Yi-Xi+1)

for each cpu, it can't use two tasks in the same time.

output: give me the minimum number of cpus neeeded an the tasks used by each cpu.

(I got a solution for M<22 and number of hours and X is small like binary search on number of cpus and dp bitmask to check if there is a solution)

complexity is high! how we can do better? for bigger M

feel free to say every idea that you have for any constraint.