Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
Each point on the left would either be connected to exactly point already connected to some left node, or a subset of the nodes on the right which are not connected to any node
Use dynamic programming with bitmasking, where the state will be (number of points assigned in first group, bitmask of points assigned in second group).