- n people, k of them have a car, .
- Each car can take at most 5 people. (including the driver)
- For each car owner, has a black list of people who can’t ride with them.
- give an algorithm to find if we can take all people to the party.
- related to flow network.
- sol: see pic in icloud.